Choice-perfect graphs

DOI10.7151/DMGT.1660zbMATH Open1293.05128OpenAlexW1974281527MaRDI QIDQ2866464FDOQ2866464

Authors: Zsolt Tuza 

Publication date: 13 December 2013

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1660

Recommendations

• List coloring of complete multipartite graphs
• scientific article; zbMATH DE number 1123764
• scientific article; zbMATH DE number 1496580
• Choice number of 3-colorable elementary graphs
• On 3-choosability of plane graphs without 5-, 8- and 9-cycles

zbMATH Keywords

graph coloringlist coloringchoice-perfect graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75) Perfect graphs (05C17)

Cited In (1)

• List coloring and \(n\)-monophilic graphs.

This page was built for publication: Choice-perfect graphs

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