# Calculating the number of the linear factors in planar graphs.

Saoud, Mahmoud; Al-Khanaifes, Kaled

Acta Universitatis Apulensis. Mathematics - Informatics (2009)

- Volume: 20, page 193-202
- ISSN: 1582-5329

## Access Full Article

top## How to cite

topSaoud, Mahmoud, and Al-Khanaifes, Kaled. "Calculating the number of the linear factors in planar graphs.." Acta Universitatis Apulensis. Mathematics - Informatics 20 (2009): 193-202. <http://eudml.org/doc/222802>.

@article{Saoud2009,

author = {Saoud, Mahmoud, Al-Khanaifes, Kaled},

journal = {Acta Universitatis Apulensis. Mathematics - Informatics},

keywords = {path; Pfaff; directed graph; bipartite graph; planar graph; tree; Kasteleyn theorem},

language = {eng},

pages = {193-202},

publisher = {"1 Decembrie 1918" University of Alba Iulia, Department of Mathematics and Informatics},

title = {Calculating the number of the linear factors in planar graphs.},

url = {http://eudml.org/doc/222802},

volume = {20},

year = {2009},

}

TY - JOUR

AU - Saoud, Mahmoud

AU - Al-Khanaifes, Kaled

TI - Calculating the number of the linear factors in planar graphs.

JO - Acta Universitatis Apulensis. Mathematics - Informatics

PY - 2009

PB - "1 Decembrie 1918" University of Alba Iulia, Department of Mathematics and Informatics

VL - 20

SP - 193

EP - 202

LA - eng

KW - path; Pfaff; directed graph; bipartite graph; planar graph; tree; Kasteleyn theorem

UR - http://eudml.org/doc/222802

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.