Planar graphs of maximum degree seven are Class I
From MaRDI portal
Publication:1850561
DOI10.1006/jctb.2001.2047zbMath1024.05031WikidataQ56390706 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
Coloring 3-power of 3-subdivision of subcubic graph, (2,1)-total labelling of planar graphs with large maximum degree, REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4, Recent progress on strong edge-coloring of graphs, A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2‐Factor Conjecture, Chromatic index, treewidth and maximum degree, Chromatic index, treewidth and maximum degree, 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 average degree of edge chromatic critical graphs with maximum degree seven, Partitioning edges of a planar graph into linear forests and a matching, A note on the size of edge-chromatic 4-critical graphs, Face-degree bounds for planar critical graphs, Facial packing edge-coloring of plane graphs, Hamiltonian cycles in critical graphs with large maximum degree, On edge colorings of 1-toroidal graphs, 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-colouring and total-colouring chordless graphs, 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, Facial parity edge colouring of plane pseudographs, Edge covering pseudo-outerplanar graphs with forests, Randomly colouring graphs (a combinatorial view), Strong chromatic index of planar graphs with large girth, Strong edge-colouring of sparse planar graphs, Facial edge ranking of plane graphs, An introduction to the discharging method via graph coloring, The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles, On \((p,1)\)-total labelling of planar graphs, Entire colouring of plane graphs, Tree-like distance colouring for planar graphs of sufficient girth, Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof, Coloring non-crossing strings, 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, The edge-face coloring of graphs embedded in a surface of characteristic zero, Coloring edges of graphs embedded in a surface of characteristic zero., 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, Extension from precoloured sets of edges, On the precise value of the strong chromatic index of a planar graph with a large girth, The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven, 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, The structure of plane graphs with independent crossings and its applications to coloring problems, Graphs whose edge set can be partitioned into maximum matchings, The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness, The edge colorings of \(K_5\)-minor free graphs, A sufficient condition for an IC-planar graph to be class 1, Facial visibility in edge colored plane graphs, Subcubic planar graphs of girth 7 are class I, Complexity-separating graph classes for vertex, edge and total colouring, A survey on the cyclic coloring and its relaxations, Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable, Total-coloring of sparse graphs with maximum degree 6, Chromatic index of graphs with no cycle with a unique chord, Incidence coloring -- cold cases, 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, The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\), Facial rainbow edge-coloring of plane graphs, Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable, A sufficient condition for a planar graph to be class I, New linear-time algorithms for edge-coloring planar graphs, 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, Local neighbor-distinguishing index of graphs, A Markov chain on the solution space of edge colorings of bipartite graphs, Finding Δ(Σ) for a Surface Σ of Characteristic −4, Acyclic edge-colouring of planar graphs. Extended abstract, Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable, Vizing's coloring algorithm and the fan number, Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles, A new upper bound for the independence number of edge chromatic critical graphs, Finding Δ(Σ) for a surface σ of characteristic χ(Σ) = −5, Facial rainbow edge-coloring of simple 3-connected plane graphs, The size of edge chromatic critical graphs with maximum degree 6
Cites Work
