Planar graphs of maximum degree seven are Class I
From MaRDI portal
Publication:1850561
DOI10.1006/jctb.2001.2047zbMath1024.05031OpenAlexW2026087461WikidataQ56390706 ScholiaQ56390706MaRDI QIDQ1850561
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1af89d317ab5d195ff69dface83cc0e777dae276
Related Items (98)
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 ⋮ Facial packing edge-coloring of plane 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 ⋮ Coloring 3-power of 3-subdivision of subcubic graph ⋮ (2,1)-total labelling of planar graphs with large maximum degree ⋮ Hamiltonian cycles in critical graphs with large maximum degree ⋮ Extension from precoloured sets of edges ⋮ REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4 ⋮ On edge colorings of 1-toroidal graphs ⋮ Edge coloring of graphs embedded in a surface of nonnegative characteristic ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2‐Factor Conjecture ⋮ On the precise value of the strong chromatic index of a planar graph with a large girth ⋮ 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 ⋮ The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\) ⋮ Sizes of critical graphs with small maximum degrees ⋮ Edge coloring of planar graphs which any two short cycles are adjacent at most once ⋮ Edge-colouring and total-colouring chordless graphs ⋮ Facial rainbow edge-coloring of plane graphs ⋮ Edge colorings of planar graphs without 5-cycles with two chords ⋮ Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable ⋮ 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 ⋮ Signed planar graphs with \(\Delta \geq 8\) are \(\Delta\)-edge-colorable ⋮ On the maximum number of edges in planar graphs of bounded degree and matching number ⋮ The structure of plane graphs with independent crossings and its applications to coloring problems ⋮ The average degree of edge chromatic critical graphs with maximum degree seven ⋮ Partitioning edges of a planar graph into linear forests and a matching ⋮ On the average degree of critical graphs with maximum degree six ⋮ Edge-chromatic numbers of Mycielski graphs ⋮ Weakening total coloring conjecture and Hadwiger's conjecture on total graphs ⋮ On edge colorings of 1-planar graphs without adjacent triangles ⋮ Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable ⋮ Facial entire colouring of plane graphs ⋮ Coloring edges of graphs embedded in a surface of characteristic zero. ⋮ The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven ⋮ Remarks on planar edge-chromatic critical graphs ⋮ Local neighbor-distinguishing index of graphs ⋮ A Markov chain on the solution space of edge colorings of bipartite graphs ⋮ Graphs whose edge set can be partitioned into maximum matchings ⋮ On \(r\)-acyclic edge colorings of planar graphs ⋮ Facial parity edge colouring of plane pseudographs ⋮ Edge covering pseudo-outerplanar graphs with forests ⋮ Edge coloring of graphs with small average degrees ⋮ A survey on the cyclic coloring and its relaxations ⋮ On edge colorings of 1-planar graphs without 5-cycles with two chords ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Unnamed Item ⋮ Entire colouring of plane graphs ⋮ Chromatic index, treewidth and maximum degree ⋮ Strong chromatic index of planar graphs with large girth ⋮ 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 ⋮ Graph edge coloring: a survey ⋮ Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable ⋮ Tree-like distance colouring for planar graphs of sufficient girth ⋮ Facial edge ranking of plane graphs ⋮ An adjacency Lemma for critical multigraphs ⋮ Total-coloring of sparse graphs with maximum degree 6 ⋮ An introduction to the discharging method via graph coloring ⋮ Edge colorings of planar graphs without 6-cycles with three chords ⋮ Chromatic index, treewidth and maximum degree ⋮ The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles ⋮ On \((p,1)\)-total labelling of planar graphs ⋮ \([r,s,t\)-coloring of trees and bipartite graphs] ⋮ New linear-time algorithms for edge-coloring planar graphs ⋮ The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness ⋮ Chromatic index of graphs with no cycle with a unique chord ⋮ Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof ⋮ 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 ⋮ Vizing's coloring algorithm and the fan number ⋮ The size of edge chromatic critical graphs with maximum degree 6 ⋮ Incidence coloring -- cold cases ⋮ Coloring non-crossing strings ⋮ On the independence number of edge chromatic critical graphs ⋮ 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 ⋮ The edge-face coloring of graphs embedded in a surface of characteristic zero ⋮ Facial visibility in edge colored plane graphs ⋮ A new upper bound for the independence number of edge chromatic critical graphs ⋮ Finding Δ(Σ) for a Surface Σ of Characteristic −4 ⋮ Recent progress on strong edge-coloring of graphs ⋮ Acyclic edge-colouring of planar graphs. Extended abstract ⋮ Edge-partition and star chromatic index
Cites Work
This page was built for publication: Planar graphs of maximum degree seven are Class I
