Planar graphs with $\Delta\geq 7$ and no triangle adjacent to a $C_4$ are minimally edge and total choosable

zbMath1336.05033arXiv1405.3422MaRDI QIDQ2808541

Alexandre Pinlou, Marthe Bonamy, Benjamin Lévêque

Publication date: 24 May 2016

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

zbMATH Keywords

planar graphsedge coloringdischarging

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

The list edge coloring and list total coloring of planar graphs with maximum degree at least 7 ⋮ Total colorings-a survey ⋮ An AIMMS-based decision-making model for optimizing the intelligent stowage of export containers in a single bay ⋮ Analysis of the clustering fusion algorithm for multi-band color image

This page was built for publication: Planar graphs with $\Delta\geq 7$ and no triangle adjacent to a $C_4$ are minimally edge and total choosable