Towards on-line Ohba's conjecture

Jakub Kozik, Piotr Micek, Xuding Zhu

Type: Preprint

Publication Date: 2011-01-01

Citations: 7

DOI: https://doi.org/10.48550/arxiv.1111.5458

View Publication

Locations

arXiv (Cornell University) - View
DataCite API - View

Similar Works

Action	Title	Year	Authors
+	Towards an on-line version of Ohba’s conjecture	2013	Jakub Kozik Piotr Micek Xuding Zhu
+ PDF Chat	On-Line Choice Number of Complete Multipartite Graphs: an Algorithmic Approach	2015	Fei-Huang Chang Hongbin Chen Jun-Yi Guo Yu-Pei Huang
+	On-Line Choice Number of Complete Multipartite Graphs: an Algorithmic Approach	2013	Fei-Huang Chang Hongbin Chen Jun-Yi Guo Yu-Pei Huang
+	Beyond Ohba’s Conjecture: A bound on the choice number of<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-chromatic graphs with<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si2.gif" display="inline" overflow="scroll"><mml:mi>n</mml:mi></mml:math>vertices	2014	Jonathan A. Noel Douglas B. West Hehui Wu Xuding Zhu
+	Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond	2013	Jonathan A. Noel
+	Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond	2013	Jonathan A. Noel
+ PDF Chat	On the Ohba Number and Generalized Ohba Numbers of Complete Bipartite Graphs	2024	Kennedy Cano Emily Gutknecht Gautham Kappaganthula George A. Miller Jeffrey A. Mudrock Ezekiel Thornburgh
+	Beyond Ohba's Conjecture: A bound on the choice number of $k$-chromatic graphs with $n$ vertices	2013	Jonathan A. Noel Douglas B. West Hehui Wu Xuding Zhu
+ PDF Chat	Choosability of Graphs with Bounded Order: Ohbaʼs Conjecture and Beyond	2013	Jonathan A. Noel Bruce A. Reed Douglas B. West Hehui Wu Xuding Zhu
+	On the clique number of the square of a line graph and its relation to Ore-degree	2017	Maxime Faron Luke Postle
+	Choice number of complete multipartite graphs $K_{33,2(k-5),12}$ and $K_{4,32,2(k-6),13}$	2013	Wenjie He Lingmin Zhang Daniel W. Cranston Yufa Shen Guoping Zheng
+	Chromatic-choosability of the power of graphs	2013	Seog‐Jin Kim Young Soo Kwon Boram Park
+	Alon-Tarsi Number of Some Regular Graphs	2023	S Prajnanaswaroopa
+	On two generalizations of the Alon-Tarsi polynomial method	2009	Dan Hefetz
+	An efficient implementation and a strengthening of Alon-Tarsi list coloring method	2023	Zdeněk Dvořák
+ PDF Chat	Seymour and Woodall's conjecture holds for graphs with independence number two	2024	Rong Chen Zijian Deng
+	On graphs with maximum difference between game chromatic number and chromatic number	2023	Lawrence Hollom
+	LIST COLORING OF COMPLETE MULTIPARTITE GRAPHS	2012	Vetr ́ õk
+ PDF Chat	Ore- and Pósa-Type Conditions for Partitioning 2-Edge-Coloured Graphs into Monochromatic Cycles	2023	Patrick Arras
+	Ore- and Pósa-type conditions for partitioning $2$-edge-coloured graphs into monochromatic cycles	2022	Patrick Arras

Works That Cite This (3)

Action	Title	Year	Authors
+ PDF Chat	Choosability of Graphs with Bounded Order: Ohbaʼs Conjecture and Beyond	2013	Jonathan A. Noel Bruce A. Reed Douglas B. West Hehui Wu Xuding Zhu
+ PDF Chat	Three topics in online list coloring	2014	James M. Carraher Sarah Loeb Thomas A. Mahoney Gregory J. Puleo Mu-Tsun Tsai Douglas B. West
+	Partial Online List Coloring of Graphs	2013	Tsai‐Lien Wong Xuding Zhu

Works Cited by This (9)

Action	Title	Year	Authors
+	Some upper bounds on the total and list chromatic numbers of multigraphs	1992	Roland Häggkvist Amanda G. Chetwynd
+	On the choosability of complete multipartite graphs with part size three	2000	H. A. Kierstead
+	Ohba’s conjecture is true for graphs with independence number at most three	2009	Yufa Shen Wenjie He Guoping Zheng LI Yan-po
+	Choice number of 3-colorable elementary graphs	1997	Sylvain Gravier Frédéric Maffray
+	List Colouring When The Chromatic Number Is Close To the Order Of The Graph	2004	Bruce Reed Benny Sudakov
+	Ohba’s conjecture for graphs with independence number five	2011	Alexandr Kostochka Michael Stiebitz Douglas R. Woodall
+	None	2002
+	List Colouring of Graphs with at Most (2 — o(l)) x Vertices	2002	Bruce Reed Benny Sudakov
+ PDF Chat	Restricted colorings of graphs	1993	Noga Alon