Equitable list coloring of planar graphs without 4- and 6-cycles
From MaRDI portal
Publication:998523
DOI10.1016/j.disc.2007.12.070zbMath1165.05008OpenAlexW2065277524MaRDI QIDQ998523
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
Related Items
The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs, Equitable coloring and equitable choosability of graphs with small maximum average degree, On Equitable List Arboricity of Graphs, A simple characterization of proportionally 2-choosable graphs, Equitable and list equitable colorings of planar graphs without 4-cycles, Equitable colorings of planar graphs without short cycles, Total equitable list coloring, On equitable and equitable list colorings of series-parallel graphs, A note on the equitable choosability of complete bipartite graphs, On list equitable total colorings of the generalized theta graph, Proportional choosability: a new list analogue of equitable coloring, Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles
Cites Work
- Unnamed Item
- Planar graphs without cycles of specific lengths
- An existential problem of a weight-controlled subset and its application to school timetable construction
- Mutual exclusion scheduling
- Equitable list coloring of graphs
- Equitable list-coloring for graphs of maximum degree 3
- A list analogue of equitable coloring
