Choosability conjectures and multicircuits

DOI10.1016/S0012-365X(00)00371-XzbMath0989.05041OpenAlexW2108248759WikidataQ123220267 ScholiaQ123220267MaRDI QIDQ5948972

Alexandr V. Kostochka, Douglas R. Woodall

Publication date: 9 April 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00371-x

zbMATH Keywords

inflationgraph colouringchoosability conjectureslist chromatic numberlist total chromatic numberlist-colouring conjecturelist-edge-colouring conjecturelist-square-colouring conjecturelist-total-colouring conjecturetotal choosability

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (25)

List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles ⋮ Total choosability of multicircuits I ⋮ Total choosability of multicircuits II ⋮ Coloring the square of a sparse graph \(G\) with almost \(\varDelta(G)\) colors ⋮ Graph \(r\)-hued colorings -- a survey ⋮ An optimal square coloring of planar graphs ⋮ Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable ⋮ A note on list-coloring powers of graphs ⋮ List Colouring Squares of Planar Graphs ⋮ 2-distance choosability of planar graphs with a restriction for maximum degree ⋮ A unified approach to distance-two colouring of graphs on surfaces ⋮ Towards an on-line version of Ohba's conjecture ⋮ Chromatic-choosability of the power of graphs ⋮ On-line choice number of complete multipartite graphs: an algorithmic approach ⋮ List-colouring the square of a \(K_4\)-minor-free graph ⋮ An introduction to the discharging method via graph coloring ⋮ Total equitable list coloring ⋮ Bipartite graphs whose squares are not chromatic-choosable ⋮ Unnamed Item ⋮ Strong list-chromatic index of subcubic graphs ⋮ Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) ⋮ Choosability of the square of planar subcubic graphs with large girth ⋮ Counterexamples to the List Square Coloring Conjecture ⋮ A Brooks-type bound for squares of \(K_{4}\)-minor-free graphs ⋮ A Proof of a Conjecture of Ohba

This page was built for publication: Choosability conjectures and multicircuits