On chromatic‐choosable graphs

DOI10.1002/JGT.10033zbMATH Open1004.05030OpenAlexW4241270175MaRDI QIDQ4539876FDOQ4539876

Authors: Kyoji Ohba 

Publication date: 11 July 2002

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10033

Recommendations

• On the choosability of some graphs
• scientific article; zbMATH DE number 1123764
• Ohba's conjecture is true for graphs with independence number at most three
• Chromatic choosability of a class of complete multipartite graphs
• Choice number of some complete multi-partite graphs

zbMATH Keywords

chromatic numberchoice number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Some upper bounds on the total and list chromatic numbers of multigraphs
• On Representatives of Subsets
• The list chromatic index of a bipartite multigraph
• Choice number of 3-colorable elementary graphs

Cited In (38)

• Chromatic-choosability of the power of graphs
• Minimal paths and cycles in set systems
• Application of polynomial method to on-line list colouring of graphs
• Title not available (Why is that?)
• Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\)
• Towards an on-line version of Ohba's conjecture
• Ohba's conjecture for graphs with independence number five
• Towards a version of Ohba's conjecture for improper colorings
• A generalization of Noel-Reed-Wu theorem to signed graphs
• An algebraic criterion for the choosability of graphs
• Critically paintable, choosable or colorable graphs
• Ohba's conjecture is true for graphs with independence number at most three
• Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\)
• On the choosability of some graphs
• ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2−(n+3)∕2 ${n}^{2}-(n+3)\unicode{x02215}2$
• Partial list colouring of certain graphs
• Total equitable list coloring
• Chromatic-choosability of hypergraphs with high chromatic number
• DP-colorings of graphs with high chromatic number
• On the chromatic number of the preferential attachment graph
• Choice numbers of multi-bridge graphs
• Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices
• The choice number versus the chromatic number for graphs embeddable on orientable surfaces
• Proportional choosability: a new list analogue of equitable coloring
• Title not available (Why is that?)
• Bad list assignments for non‐k $k$‐choosable k $k$‐chromatic graphs with 2k+2 $2k+2$‐vertices
• On choosability of some complete multipartite graphs and Ohba's conjecture
• List coloring a Cartesian product with a complete bipartite factor
• On-line choice number of complete multipartite graphs: an algorithmic approach
• A weaker version of a conjecture on list vertex arboricity of graphs
• On improperly chromatic-choosable graphs
• Interview with Douglas West
• On the adaptable chromatic number of graphs
• Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum
• A proof of a conjecture of Ohba
• List point arboricity of dense graphs
• On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs
• Choosability of powers of circuits

This page was built for publication: On chromatic‐choosable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4539876)