Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
From MaRDI portal
Publication:641187
DOI10.1016/j.disc.2011.06.031zbMath1245.05050OpenAlexW2034978638MaRDI QIDQ641187
Publication date: 21 October 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.06.031
Related Items (10)
A note on the minimum number of choosability of planar graphs ⋮ List edge and list total coloring of planar graphs without intersecting 8-cycles ⋮ List edge and list total coloring of planar graphs with maximum degree 8 ⋮ Optimal channel assignment with list-edge coloring ⋮ A note on list edge and list total coloring of planar graphs without adjacent short cycles ⋮ Total equitable list coloring ⋮ Unnamed Item ⋮ Minimum choosability of planar graphs ⋮ List edge colorings of planar graphs without adjacent 7-cycles ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges
Cites Work
- Unnamed Item
- Unnamed Item
- On the total choosability of planar graphs and of sparse graphs
- List edge and list total colorings of planar graphs without 4-cycles
- List edge and list total colorings of planar graphs without short cycles
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
- Edge choosability of planar graphs without 5-cycles with a chord
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- List-colourings of graphs
- List edge and list total colourings of multigraphs
- List Total Colourings of Graphs
- Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
- A note on total colorings of planar graphs without 4-cycles
- Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
- 25 pretty graph colouring problems
This page was built for publication: Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles
