Results 251 to 260 of about 28,812 (264)

A bound on the chromatic number of the square of a planar graph

Journal of Combinatorial Theory Series B, 2005
Mohammad Salavatipour
exaly  

A sufficient condition for a planar graph to be 4-choosable

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

A planar hypohamiltonian graph with 48 vertices

Journal of Graph Theory, 2007
Carol Zamfirescu
exaly  

A sufficient condition for a planar graph to be 3-choosable

Information Processing Letters, 2007
Yingqian Wang
exaly  

A sufficient condition for a planar graph to be class 1

Theoretical Computer Science, 2007
Weifan Wang
exaly  

Minimizing the Oriented Diameter of a Planar Graph

Electronic Notes in Discrete Mathematics, 2009
Steven Noble
exaly  

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

Discrete Mathematics, 2019
Xiangwen Li, Runrun Liu
exaly  

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
exaly  

Every planar graph has an acyclic 7-coloring

Israel Journal of Mathematics, 1977
Michael O Albertson
exaly