Results 251 to 260 of about 27,884 (262)

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

Discrete Mathematics, 2019
Xiangwen Li
exaly  

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

Information Processing Letters, 2007
Yingqian Wang
exaly  

Parameterized complexity: exponential speed-up for planar graph problems

Journal of Algorithms, 2004
Henning Fernau, Rolf Niedermeier
exaly  

MTPSO algorithm for solving planar graph coloring problem

Expert Systems With Applications, 2011
Muhammad Khurram Khan
exaly  

A planar hypohamiltonian graph with 48 vertices

Journal of Graph Theory, 2007
Carol T Zamfirescu
exaly  

On simultaneous planar graph embeddings

Computational Geometry: Theory and Applications, 2007
Cesim Erten, Dan Ismailescu, Stephen G Kobourov   +2 more
exaly  

Every Planar Graph with Maximum Degree 7 Is of Class 1

Graphs and Combinatorics, 2000
exaly  

Minimizing the Oriented Diameter of a Planar Graph

Electronic Notes in Discrete Mathematics, 2009
exaly  

Every planar graph has an acyclic 7-coloring

Israel Journal of Mathematics, 1977
exaly  

A sufficient condition for a planar graph to be class 1

Theoretical Computer Science, 2007
exaly