Equitable list colorings of planar graphs without short cycles

DOI10.1016/J.TCS.2008.04.018zbMATH Open1152.05027OpenAlexW2006947206MaRDI QIDQ954980FDOQ954980

Authors Junlei Zhu, Yuehua Bu

Publication date 18 November 2008

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2008.04.018

zbMATH Keywords

degenerateequitable coloringplane graphequitable list coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 1308943 (Why is no real title available?)
• scientific article; zbMATH DE number 1046311 (Why is no real title available?)
• scientific article; zbMATH DE number 3344609 (Why is no real title available?)
• A list analogue of equitable coloring
• Choosability and edge choosability of planar graphs without five cycles
• Equitable Coloring
• Equitable Colourings of d-degenerate Graphs
• Equitable coloring and the maximum degree
• Equitable coloring of trees
• Equitable colorings of line graphs and complete \(r\)-partite graphs
• Equitable list coloring of graphs
• Equitable list-coloring for graphs of maximum degree 3
• On equitable coloring of bipartite graphs

Cited in

(24)

• Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles
• Equitable coloring and equitable choosability of planar graphs without 5- and 7-cycles
• A note on the equitable choosability of complete bipartite graphs
• On list equitable total colorings of the generalized theta graph
• On the small cycle transversal of planar graphs
• On the small cycle transversal of planar graphs
• Equitable colorings of planar graphs without short cycles
• Equitable coloring and equitable choosability of graphs with small maximum average degree
• On equitable and equitable list colorings of series-parallel graphs
• On the equitable vertex arboricity of graphs
• Equitable coloring planar graphs with large girth
• A simple characterization of proportionally 2-choosable graphs
• Proportional choosability: a new list analogue of equitable coloring
• A generalization of Grötzsch Theorem on the local-equitable coloring
• Equitable and list equitable colorings of planar graphs without 4-cycles
• Total equitable list coloring
• Equitable list coloring of planar graphs without 4- and 6-cycles
• Equitable and list equitable colorings of planar graphs without \(6\)-cycles.
• Equitable list coloring of planar graphs without 3 and 4 cycles
• Equitable list coloring of graphs
• On equitable list arboricity of graphs
• Equitable list coloring of planar graphs without 4-and 7-cycles
• Equitable vertex arboricity of graphs
• New kernels for several problems on planar graphs

This page was built for publication: Equitable list colorings of planar graphs without short cycles

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