Results 251 to 260 of about 28,550 (268)

Every planar graph with girth at least 5 is (1,9)-colorable

Discrete Mathematics, 2022
Xiangwen Li
exaly  

Coloring the square of a planar graph

Journal of Graph Theory, 2003
Jan Van den Heuvel
exaly  

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

Journal of Combinatorial Theory Series B, 2005
Mohammad R Salavatipour
exaly  

Every Planar Graph with Maximum Degree 7 Is of Class 1

Graphs and Combinatorics, 2000
Limin Zhang
exaly  

Gracker: A Graph-Based Planar Object Tracker

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2018
Tao Wang, Haibin Ling
exaly  

When a zero-divisor graph is planar or a complete r-partite graph

Journal of Algebra, 2003
S Akbari, H R Maimani, S Yassemi
exaly  

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

Discrete Mathematics, 2019
Xiangwen Li
exaly  

Minimizing the Oriented Diameter of a Planar Graph

Electronic Notes in Discrete Mathematics, 2009
Steven D Noble
exaly  

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

Information Processing Letters, 2007
Liang Shen, Yingqian Wang
exaly  

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

Discrete Applied Mathematics, 2017
Renyu Xu, Jianliang Wu
exaly