Results 261 to 268 of about 29,288 (268)

Every planar graph has an acyclic 7-coloring

Israel Journal of Mathematics, 1977
Michael O Albertson
exaly  

MTPSO algorithm for solving planar graph coloring problem

Expert Systems With Applications, 2011
Muhammad Khurram Khan, Shi-Jinn Horng, Ray-Shine Run   +2 more
exaly  

A planar hypohamiltonian graph with 48 vertices

Journal of Graph Theory, 2007
Carol Zamfirescu
exaly  

Every Planar Graph with Maximum Degree 7 Is of Class 1

Graphs and Combinatorics, 2000
exaly  

Planar map graphs

Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98, 1998
Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou   +2 more
openaire   +1 more source

Some sufficient conditions for a planar graph of maximum degree six to be Class 1

Discrete Mathematics, 2006
Weifan Wang, Yuehua Bu
exaly  

On floorplans of planar graphs

Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97, 1997
openaire   +1 more source

The square of every subcubic planar graph of girth at least 6 is 7-choosable

Discrete Mathematics
Seog-Jin Kim
exaly