Equitable list coloring of planar graphs without 4- and 6-cycles
From MaRDI portal
Publication:998523
DOI10.1016/J.DISC.2007.12.070zbMATH Open1165.05008OpenAlexW2065277524MaRDI QIDQ998523FDOQ998523
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
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
- Title not available (Why is that?)
- 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
- Planar graphs without cycles of specific lengths
Cited In (19)
- On equitable list arboricity of graphs
- Equitable list coloring of planar graphs without 3 and 4 cycles
- Equitable coloring and equitable choosability of planar graphs without 6- and 7-cycles.
- Equitable and list equitable colorings of planar graphs without \(6\)-cycles.
- Total equitable list coloring
- The strong chromatic index of graphs and subdivisions
- Equitable coloring and equitable choosability of graphs with small maximum average degree
- 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
- Equitable list-coloring for graphs of maximum degree 3
- Equitable list colorings of planar graphs without short cycles
- Proportional choosability: a new list analogue of equitable coloring
- Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles
- Equitable list coloring of graphs with bounded degree
- Equitable colorings of planar graphs without short cycles
- A simple characterization of proportionally 2-choosable graphs
- Equitable list coloring and treewidth
- Equitable and list equitable colorings of planar graphs without 4-cycles
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)
