Results 291 to 298 of about 892,813 (298)

A sufficient condition for a planar graph to be -choosable

Discrete Applied Mathematics, 2017
Jian-Liang Wu, Renyu Xu
exaly  

Parameterized complexity: exponential speed-up for planar graph problems

Journal of Algorithms, 2004
Henning Fernau, Rolf Niedermeier, Jochen Alber   +2 more
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   +2 more sources

A sufficient condition for a planar graph to be class 1

Theoretical Computer Science, 2007
Weifan Wang
exaly  

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, Yuh-Rau Wang   +2 more
exaly  

Any Maximal Planar Graph with Only One Separating Triangle is Hamiltonian

Journal of Combinatorial Optimization, 2003
Chiuyuan Chen
exaly  

Every Planar Graph with Maximum Degree 7 Is of Class 1

Graphs and Combinatorics, 2000
exaly