A sufficient condition for a plane graph with maximum degree 6 to be class 1

DOI10.1016/J.DAM.2012.08.011zbMath1254.05060OpenAlexW2073746531MaRDI QIDQ1759890

Lingji Xu, Ying Qian Wang

Publication date: 22 November 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.08.011

zbMATH Keywords

edge coloringmaximum degreeplanar graph conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (10)

A sufficient condition for edge 6-colorable planar graphs with maximum degree 6 ⋮ Face-degree bounds for planar critical graphs ⋮ Edge colorings of planar graphs without 5-cycles with two chords ⋮ Remarks on planar edge-chromatic critical graphs ⋮ A survey on the cyclic coloring and its relaxations ⋮ Facial rainbow edge-coloring of simple 3-connected plane graphs ⋮ Graph edge coloring: a survey ⋮ Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable ⋮ An introduction to the discharging method via graph coloring ⋮ A sufficient condition for an IC-planar graph to be class 1

This page was built for publication: A sufficient condition for a plane graph with maximum degree 6 to be class 1