Choosability of powers of circuits

DOI10.1007/s00373-002-0486-8zbMath1015.05028OpenAlexW1971784273MaRDI QIDQ1396660

Douglas R. Woodall, Anton Prowse

Publication date: 8 July 2003

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-002-0486-8

zbMATH Keywords

claw-free graphgraph colouringchoosabilitylist chromatic numberlist colouringsquare of a graphcircuit powerinflation of a graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (22)

Colouring powers of cycles from random lists ⋮ A Brooks-like result for graph powers ⋮ On two generalizations of the Alon-Tarsi polynomial method ⋮ Orientations of graphs with prescribed weighted out-degrees ⋮ On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs ⋮ Biclique-colouring verification complexity and biclique-colouring power graphs ⋮ List-colouring the square of a \(K_4\)-minor-free graph ⋮ Shifts of the stable Kneser graphs and hom-idempotence ⋮ Total equitable list coloring ⋮ On the list dynamic coloring of graphs ⋮ Combinatorial Nullstellensatz and DP-coloring of graphs ⋮ Towards a version of Ohba's conjecture for improper colorings ⋮ Independence and coloring properties of direct products of some vertex-transitive graphs ⋮ List coloring a Cartesian product with a complete bipartite factor ⋮ Inflation of strongly connected networks ⋮ Incidence choosability of graphs ⋮ Colouring clique-hypergraphs of circulant graphs ⋮ On the edit distance of powers of cycles ⋮ Alon-Tarsi numbers of direct products ⋮ On list critical graphs ⋮ Locating chromatic number of powers of paths and cycles ⋮ An algebraic criterion for the choosability of graphs

This page was built for publication: Choosability of powers of circuits