Calculating the number of the linear factors in planar graphs.

@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 -