Equitable list coloring of planar graphs without 4- and 6-cycles

DOI10.1016/J.DISC.2007.12.070zbMATH Open1165.05008OpenAlexW2065277524MaRDI QIDQ998523FDOQ998523

Authors Qiong Li, Yuehua Bu

Publication date 28 January 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2007.12.070

zbMATH Keywords

planar graphsvertex colouringlist coloringslist assignment

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Equitable and list equitable colorings of planar graphs without \(6\)-cycles.
• Equitable list coloring of planar graphs without 3 and 4 cycles
• Equitable and list equitable colorings of planar graphs without 4-cycles
• Equitable coloring and equitable choosability of planar graphs without 6- and 7-cycles.
• Equitable list colorings of planar graphs without short cycles

Cites work

• scientific article; zbMATH DE number 949303 (Why is no real title available?)
• A list analogue of equitable coloring
• An existential problem of a weight-controlled subset and its application to school timetable construction
• Equitable list coloring of graphs
• Equitable list-coloring for graphs of maximum degree 3
• Mutual exclusion scheduling
• Planar graphs without cycles of specific lengths

Cited in

(18)

• Equitable coloring and equitable choosability of planar graphs without 6- and 7-cycles.
• Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles
• A note on the equitable choosability of complete bipartite graphs
• On list equitable total colorings of the generalized theta graph
• Equitable list colorings of planar graphs without short cycles
• Equitable colorings of planar graphs without short cycles
• Equitable coloring and equitable choosability of graphs with small maximum average degree
• Equitable list coloring and treewidth
• On equitable and equitable list colorings of series-parallel graphs
• Equitable list coloring of graphs with bounded degree
• A simple characterization of proportionally 2-choosable graphs
• Proportional choosability: a new list analogue of equitable coloring
• Equitable and list equitable colorings of planar graphs without 4-cycles
• Total equitable list coloring
• Equitable list-coloring for graphs of maximum degree 3
• Equitable and list equitable colorings of planar graphs without \(6\)-cycles.
• Equitable list coloring of planar graphs without 3 and 4 cycles
• On equitable list arboricity of graphs

This page was built for publication: Equitable list coloring of planar graphs without 4- and 6-cycles

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