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

Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable

Discrete Mathematics, 2019
Xiangwen Li, Runrun Liu
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

The random planar graph process

Random Structures and Algorithms, 2008
Anusch Taraz, Angelika Steger
exaly  

Parameterized complexity: exponential speed-up for planar graph problems

Journal of Algorithms, 2004
Henning Fernau, Rolf Niedermeier, Jochen Alber   +2 more
exaly  

Every planar graph has an acyclic 7-coloring

Israel Journal of Mathematics, 1977
Michael O Albertson
exaly  

Every Planar Graph with Maximum Degree 7 Is of Class 1

Graphs and Combinatorics, 2000
exaly  

A Important Property on Planar Graph

Applied Mechanics and Materials, 2011
Na Na Li
exaly  

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

Discrete Mathematics
Seog-Jin Kim
exaly