Every planar graph with maximum degree 7 is of class 1

Recommendations

Planar graphs of maximum degree seven are Class I
A sufficient condition for a plane graph with maximum degree 6 to be class 1
A new sufficient condition for a planar graph of maximum degree six to be class 1
A sufficient condition for edge 6-colorable planar graphs with maximum degree 6
A note on class one graphs with maximum degree six

Cited in

(78)

The edge-face coloring of graphs embedded in a surface of characteristic zero
New results on chromatic index critical graphs
Edge coloring of graphs with small maximum degrees
Edge coloring of graphs with small average degrees
List-edge-colouring planar graphs with precoloured edges
Edge coloring of planar graphs without adjacent 7-cycles
On edge colorings of 1-planar graphs without 5-cycles with two chords
Graph edge coloring: a survey
Edge colorings of planar graphs without 6-cycles with three chords
A sufficient condition for a plane graph with maximum degree 6 to be class 1
Planar graphs of maximum degree seven are Class I
Average degrees of edge-chromatic critical graphs
The edge colorings of \(K_5\)-minor free graphs
A sufficient condition for an IC-planar graph to be class 1
Subcubic planar graphs of girth 7 are class I
Complexity-separating graph classes for vertex, edge and total colouring
A note on 1-planar graphs with minimum degree 7
Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable
Upper bounds on the maximum degree of class two graphs on surfaces
Edge-partition and star chromatic index
Edge coloring of graphs embedded in a surface of nonnegative characteristic
Facially-constrained colorings of plane graphs: a survey
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
A sufficient condition for a planar graph to be class I
The average degree of an edge-chromatic critical graph
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
On the independence number of edge chromatic critical graphs
Finding () for a surface of characteristic -4
On the size of critical graphs with small maximum degree
A note on the size of edge-chromatic 4-critical graphs
Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles
Face-degree bounds for planar critical graphs
Finding ( ) for a surface of characteristic () = -5
Facial rainbow edge-coloring of simple 3-connected plane graphs
On edge colorings of 1-toroidal graphs
The size of edge chromatic critical graphs with maximum degree 6
Class I graphs of nonnegative characteristic without special cycles
Edge coloring of planar graphs which any two short cycles are adjacent at most once
Edge colorings of planar graphs without 5-cycles with two chords
Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees
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
On \(r\)-acyclic edge colorings of planar graphs
Strong edge-colouring of sparse planar graphs
Some sufficient conditions for 1-planar graphs to be class 1
A new sufficient condition for a planar graph of maximum degree six to be class 1
An introduction to the discharging method via graph coloring
REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4
Recent progress on strong edge-coloring of graphs
Chromatic index, treewidth and maximum degree
Chromatic index, treewidth and maximum degree
Strong edge-coloring of planar graphs
The average degree of edge chromatic critical graphs with maximum degree seven
scientific article; zbMATH DE number 7790331 (Why is no real title available?)
Entire colouring of plane graphs
Conflict-free incidence coloring of outer-1-planar graphs
Sufficient conditions make graphs edge DP--colorable
The strong chromatic index of 1-planar graphs
Recognition complexity of subgraphs of \({\mathbf{k}}\)-connected planar cubic graphs
An adjacency lemma on signed edge colorings with an application to planar graphs
Weak degeneracy of line graphs of planar graphs
Efficient recognition of subgraphs of planar cubic bridgeless graphs
Edge coloring lattice graphs
On the chromatic edge stability index of planar and regular graphs
A sufficient condition for edge 6-colorable planar graphs with maximum degree 6
A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems
Sizes of critical graphs with small maximum degrees
Facial entire colouring of plane graphs
Remarks on planar edge-chromatic critical graphs
Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic \(\epsilon \in \{-1, -2, -3\}\)
An adjacency Lemma for critical multigraphs
\([r,s,t]\)-coloring of trees and bipartite graphs
On the size of critical graphs with maximum degree 8
On the size of edge-coloring critical graphs with maximum degree 4

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5935607)