Steinberg's Conjecture and near-colorings

Gerard J. Chang, Frédéric Havet, Mickaël Montassier, André Raspaud

Type: Article

Publication Date: 2011-07-01

Citations: 15

Similar Works

Action	Title	Year	Authors
+	A relaxation of Steinberg's Conjecture	2012	Owen Hill Gexin Yu
+ PDF Chat	A Relaxation of Steinberg's Conjecture	2013	Owen Hill Gexin Yu
+	(1,0,0)-colorability of planar graphs without cycles of length 4 or 6	2020	Ligang Jin Yingli Kang Peipei Liu Yingqian Wang
+	Planar graphs without cycles of length 4 or 5 are<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si9.gif" display="inline" overflow="scroll"><mml:mrow><mml:mo>(</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>0</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-colorable	2013	Owen Hill Diana Smith Yingqian Wang Lingji Xu Gexin Yu
+ PDF Chat	(1,0,0)-colorability of planar graphs without cycles of length 4 or 6	2021	Yingli Kang Ligang Jin Peipei Liu Yingqian Wang
+ PDF Chat	Near-Colorings: Non-Colorable Graphs and NP-Completeness	2015	Mickaël Montassier Pascal Ochem
+	Near-colorings: non-colorable graphs and NP-completeness	2013	Mickaël Montassier Pascal Ochem
+	Planar graphs without short even cycles are near-bipartite	2021	Runrun Liu Gexin Yu
+	Planar graphs without cycles of length 4 or 5 are <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e67" altimg="si9.svg"><mml:mrow><mml:mo>(</mml:mo><mml:mn>11</mml:mn><mml:mo>:</mml:mo><mml:mn>3</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-colorable	2019	Zdeněk Dvořák Xiaolan Hu
+	Planar graphs without short even cycles are near-bipartite	2020	Runrun Liu Gexin Yu
+	Degree-Limited Defective Three Colorings of Planar Graphs Containing No 4-Cycles or 5-Cycles	2016	Addie Armstrong
+ PDF Chat	Steinberg-like theorems for backbone colouring	2015	Júlio Araújo Frédéric Havet Michael Schmitt
+	Planar graphs without cycles of length 4 or 5 are (11:3)-colorable	2018	Zdeněk Dvořák Xiaolan Hu
+	Near Optimal Colourability on Hereditary Graph Families	2023	Yiao Ju Shenwei Huang
+	Fractional Coloring Planar Graphs under Steinberg-type Conditions	2022	Xiao Lan Hu Jiaao Li
+	The 1-2-3 Conjecture and related problems: a survey	2012	Ben Seamone
+	Partitioning planar graphs without $4$-cycles and $5$-cycles into bounded degree forests	2020	Eun‐Kyung Cho Ilkyoo Choi Boram Park
+	Steinberg's Conjecture is false	2016	Vincent Cohen-Addad Michael Hebdige Daniel Kráľ Zhentao Li Esteban Salgado
+	Steinberg's Conjecture is false	2016	Vincent Cohen-Addad Michael Hebdige Daniel Kráľ Zhentao Li Esteban Salgado
+	Steinberg's Conjecture is false	2016	Vincent Cohen-Addad Michael Hebdige Daniel Kráľ Zhentao Li Esteban Salgado

Works That Cite This (10)

Action	Title	Year	Authors
+	A relaxation of the strong Bordeaux Conjecture	2015	Ziwen Huang Xiangwen Li Gexin Yu
+	Planar graphs without 5-cycles and intersecting triangles are $(1,1,0)$-colorable	2014	Runrun Liu Xiangwen Li Gexin Yu
+	A relaxation of the Bordeaux Conjecture	2014	Runrun Liu Xiangwen Li Gexin Yu
+	Planar graphs without adjacent cycles of length at most five are (1,1,0) -colorable	2016	Chuanni Zhang Yingqian Wang Min Chen
+ PDF Chat	Note on improper coloring of $1$-planar graphs	2019	Yanan Chu Lei Sun Jun Yue
+ PDF Chat	A relaxation of the strong Bordeaux Conjecture	2017	Ziwen Huang Xiangwen Li Gexin Yu
+	A relaxation of Steinberg's Conjecture	2012	Owen Hill Gexin Yu
+	Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable	2016	Ying Bai Xiangwen Li Gexin Yu
+ PDF Chat	Planar graphs without 5-cycles and intersecting triangles are <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mn>0</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-colorable	2015	Runrun Liu Xiangwen Li Gexin Yu
+ PDF Chat	Near-Colorings: Non-Colorable Graphs and NP-Completeness	2015	Mickaël Montassier Pascal Ochem

Works Cited by This (1)

Action	Title	Year	Authors
+	The State of the Three Color Problem	1993	Richard Steinberg