Results 261 to 268 of about 29,089 (268)
Some of the next articles are maybe not open access.
Every planar graph has an acyclic 7-coloring
Israel Journal of Mathematics, 1977Michael O Albertson
exaly
MTPSO algorithm for solving planar graph coloring problem
Expert Systems With Applications, 2011Muhammad Khurram Khan +2 more
exaly
On the pagenumber of planar graphs
Proceedings of the sixteenth annual ACM symposium on Theory of computing - STOC '84, 1984Jonathan F. Buss, Peter W. Shor
openaire +1 more source
Some sufficient conditions for a planar graph of maximum degree six to be Class 1
Discrete Mathematics, 2006Weifan Wang, Yuehua Bu
exaly
On floorplans of planar graphs
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97, 1997openaire +1 more source
The square of every subcubic planar graph of girth at least 6 is 7-choosable
Discrete MathematicsSeog-Jin Kim
exaly