Results 1 to 10 of about 30,355,657 (248)

Minimizing the Oriented Diameter of a Planar Graph [PDF]

Electronic Notes in Discrete Mathematics, 2009
We consider the problem of minimizing the diameter of an orientation of a planar graph. A result of Chvátal and Thomassen shows that for general graphs, it is NP-complete to decide whether a graph can be oriented so that its diameter is at most two.
Steven Noble
exaly   +2 more sources

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  

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, 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