Choosability of powers of circuits

DOI10.1007/S00373-002-0486-8MaRDI QIDQ1396660zbMATH OpenOpenAlexFDO

Authors Anton Prowse, Douglas R. Woodall

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

choosabilityclaw-free graphgraph colouringlist colouringsquare of a graphlist chromatic numbercircuit powerinflation of a graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Chromatic-choosability of the power of graphs
• Total choosability of multicircuits II
• On chromatic‐choosable graphs
• Some results on \((a:b)\)-choosability
• A note on list-coloring powers of graphs

Cited in

(26)

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

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

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