List colorings and reducibility

DOI10.1016/S0166-218X(97)00046-2zbMATH Open0882.05055OpenAlexW2028983129MaRDI QIDQ1372746FDOQ1372746

Authors: Zsolt Tuza, Margit Voigt 

Publication date: 28 January 1998

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

Full work available at URL: http://www.elsevier.com/locate/dam

Recommendations

• On the number of list‐colorings
• A note on list-colorings
• scientific article; zbMATH DE number 5531976
• List-colourings of graphs
• The chromatic polynomial and list colorings
• Algorithmic complexity of list colorings
• A note on partial list coloring
• Partial list colorings
• A Hajós-like theorem for list coloring
• List Set Colouring: Bounds and Algorithms

zbMATH Keywords

bipartite graphlist coloringPetersen graph\(k\)-choosable graph\(U\)-reducible graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Graph colorings with local constraints -- a survey
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• List supermodular coloring with shorter lists
• Asymptotically the list colouring constants are 1
• List supermodular coloring
• On completing latin squares
• Nonrepetitive list colorings of the integers
• On the list coloring version of Reed's conjecture
• A Hajós-like theorem for list coloring

This page was built for publication: List colorings and reducibility

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