Every planar graph with maximum degree 7 is of class 1

DOI10.1007/s003730070009zbMath0988.05042OpenAlexW1995035986MaRDI QIDQ5935607

Li-Min Zhang

Publication date: 30 June 2002

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003730070009

zbMATH Keywords

planar graphsVizing's conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (66)

List-edge-colouring planar graphs with precoloured edges ⋮ A sufficient condition for edge 6-colorable planar graphs with maximum degree 6 ⋮ A note on the size of edge-chromatic 4-critical graphs ⋮ Finding Δ(Σ) for a surface σ of characteristic χ(Σ) = −5 ⋮ Face-degree bounds for planar critical graphs ⋮ A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems ⋮ Subcubic planar graphs of girth 7 are class I ⋮ Edge coloring of planar graphs without adjacent 7-cycles ⋮ REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4 ⋮ On edge colorings of 1-toroidal graphs ⋮ On the size of critical graphs with small maximum degree ⋮ Edge coloring of graphs embedded in a surface of nonnegative characteristic ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Class I graphs of nonnegative characteristic without special cycles ⋮ Finding \(\Delta (\Sigma)\) for a surface \(\Sigma \) of characteristic \(-6\) and \(-7\) ⋮ On the equitable edge-coloring of 1-planar graphs and planar graphs ⋮ On the size of edge chromatic 5-critical graphs ⋮ Sizes of critical graphs with small maximum degrees ⋮ Edge coloring of planar graphs which any two short cycles are adjacent at most once ⋮ Hamiltonicity of edge-chromatic critical graphs ⋮ Edge colorings of planar graphs without 5-cycles with two chords ⋮ Complexity-separating graph classes for vertex, edge and total colouring ⋮ Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees ⋮ The average degree of edge chromatic critical graphs with maximum degree seven ⋮ On the average degree of critical graphs with maximum degree six ⋮ Edge-chromatic numbers of Mycielski graphs ⋮ On edge colorings of 1-planar graphs without adjacent triangles ⋮ Facial entire colouring of plane graphs ⋮ Remarks on planar edge-chromatic critical graphs ⋮ On \(r\)-acyclic edge colorings of planar graphs ⋮ Edge coloring of graphs with small average degrees ⋮ On edge colorings of 1-planar graphs without 5-cycles with two chords ⋮ Unnamed Item ⋮ Entire colouring of plane graphs ⋮ Chromatic index, treewidth and maximum degree ⋮ Strong edge-colouring of sparse planar graphs ⋮ Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic \(\epsilon \in \{-1, -2, -3\}\) ⋮ A sufficient condition for a planar graph to be class I ⋮ Facial rainbow edge-coloring of simple 3-connected plane graphs ⋮ Some sufficient conditions for 1-planar graphs to be class 1 ⋮ Graph edge coloring: a survey ⋮ Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable ⋮ An adjacency Lemma for critical multigraphs ⋮ An introduction to the discharging method via graph coloring ⋮ Edge colorings of planar graphs without 6-cycles with three chords ⋮ The average degree of an edge-chromatic critical graph ⋮ Chromatic index, treewidth and maximum degree ⋮ \([r,s,t\)-coloring of trees and bipartite graphs] ⋮ Average degrees of edge-chromatic critical graphs ⋮ On the size of critical graphs with maximum degree 8 ⋮ Some sufficient conditions for a planar graph of maximum degree six to be Class 1 ⋮ A note on class one graphs with maximum degree six ⋮ The edge colorings of \(K_5\)-minor free graphs ⋮ The size of edge chromatic critical graphs with maximum degree 6 ⋮ On the independence number of edge chromatic critical graphs ⋮ On the size of edge-coloring critical graphs with maximum degree 4 ⋮ Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles ⋮ Upper bounds on the maximum degree of class two graphs on surfaces ⋮ A sufficient condition for an IC-planar graph to be class 1 ⋮ Strong edge-coloring of planar graphs ⋮ The edge-face coloring of graphs embedded in a surface of characteristic zero ⋮ Finding Δ(Σ) for a Surface Σ of Characteristic −4 ⋮ Recent progress on strong edge-coloring of graphs ⋮ New results on chromatic index critical graphs ⋮ Edge coloring of graphs with small maximum degrees ⋮ Edge-partition and star chromatic index

This page was built for publication: Every planar graph with maximum degree 7 is of class 1