Abstract

Every planar simple graph with n vertices has at least 2n/9Z5-colorings.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title
Journal
Date
Author
On total chromatic number of planar graphs without 4-cycles
Min-Le Shangguan ... Ying-Qian Wang
Science in China Series A: Mathematics | VOL. 50
Min-Le Shangguan, et. al.Min-Le Shangguan ... Ying-Qian Wang
01 Jan 2007
Connectivity of Minimum Non-5-injectively Colorable Planar Cubic Graphs
Jing Jin ... Bao-Gang Xu
Journal of the Operations Research Society of China | VOL. 8
Jing Jin, et. al.Jing Jin ... Bao-Gang Xu
02 Aug 2018
Plane Graphs with Maximum Degree Are Entirely ‐Colorable
Xianghua Mao ... Yingqian Wang
Journal of Graph Theory | VOL. 73
Xianghua Mao, et. al.Xianghua Mao ... Yingqian Wang
30 Jul 2012
Random graphs with structural constraints
-
01 Jan 2007
View more papers

More From: Discrete Mathematics

Paper Title
Journal
Date
Author
Transversal numbers of stacked spheres
Minho Cho ... Jinha Kim
Discrete Mathematics | VOL. 347
Minho Cho, et. al.Minho Cho ... Jinha Kim
08 May 2024
New qubit codes from multidimensional circulant graphs
Padmapani Seneviratne ... Adrian Thananopavarn
Discrete Mathematics | VOL. 347
Padmapani Seneviratne, et. al.Padmapani Seneviratne ... Adrian Thananopavarn
03 May 2024
Gallai's conjecture for 3-degenerated graphs
Junhao Zhang ... Yanmei Hong
Discrete Mathematics | VOL. 347
Junhao Zhang, et. al.Junhao Zhang ... Yanmei Hong
03 May 2024
The maximum size of an induced forest in the binomial random graph
Margarita Akhmejanova ... Vladislav Kozhevnikov
Discrete Mathematics | VOL. 347
Margarita Akhmejanova, et. al.Margarita Akhmejanova ... Vladislav Kozhevnikov
03 May 2024
View more papers