Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles

DOI10.7151/DMGT.1438zbMath1198.05044arXivmath/0512518OpenAlexW2023179859MaRDI QIDQ5324109

Daniel W. Cranston

Publication date: 3 August 2009

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0512518

zbMATH Keywords

edge coloringVizing's conjecturetotal coloringlist coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (4)

Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles ⋮ An introduction to the discharging method via graph coloring ⋮ Total equitable list coloring ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges

This page was built for publication: Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles