Planar graphs of maximum degree seven are Class I
From MaRDI portal
Publication:1850561
DOI10.1006/JCTB.2001.2047zbMATH Open1024.05031OpenAlexW2026087461WikidataQ56390706 ScholiaQ56390706MaRDI QIDQ1850561FDOQ1850561
Authors: Daniel P. Sanders, Yue Zhao 
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
Recommendations
- Every planar graph with maximum degree 7 is of class 1
- The edge colorings of \(K_5\)-minor free graphs
- A new sufficient condition for a planar graph of maximum degree six to be class 1
- A sufficient condition for a plane graph with maximum degree 6 to be class 1
- Edge colorings of planar graphs without 6-cycles with three chords
Cites Work
Cited In (only showing first 100 items - show all)
- A survey on the cyclic coloring and its relaxations
- Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable
- List-edge-colouring planar graphs with precoloured edges
- Title not available (Why is that?)
- Edge colorings of planar graphs without 6-cycles with three chords
- The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness
- Edge-partition and star chromatic index
- On the precise value of the strong chromatic index of a planar graph with a large girth
- On the equitable edge-coloring of 1-planar graphs and planar graphs
- Facial rainbow edge-coloring of plane graphs
- Facial rainbow edge-coloring of simple 3-connected plane graphs
- On the independence number of edge chromatic critical graphs
- The edge colorings of \(K_5\)-minor free graphs
- Vizing's coloring algorithm and the fan number
- Edge coloring of planar graphs without adjacent 7-cycles
- Subcubic planar graphs of girth 7 are class I
- Chromatic index, treewidth and maximum degree
- Signed planar graphs with \(\Delta \geq 8\) are \(\Delta\)-edge-colorable
- Incidence coloring -- cold cases
- Conflict-free incidence coloring of outer-1-planar graphs
- A sufficient condition for an IC-planar graph to be class 1
- Upper bounds on the maximum degree of class two graphs on surfaces
- Facial visibility in edge colored plane graphs
- Finding \(\Delta (\Sigma)\) for a surface \(\Sigma \) of characteristic \(-6\) and \(-7\)
- Total-coloring of sparse graphs with maximum degree 6
- Complexity-separating graph classes for vertex, edge and total colouring
- Finding \(\Delta(\Sigma)\) for a surface \(\Sigma\) of characteristic \(-4\)
- Sufficient conditions make graphs edge DP-\(\varDelta\)-colorable
- Recent progress on strong edge-coloring of graphs
- A Markov chain on the solution space of edge colorings of bipartite graphs
- Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles
- Weakening total coloring conjecture and Hadwiger's conjecture on total graphs
- On the maximum number of edges in planar graphs of bounded degree and matching number
- Chromatic index, treewidth and maximum degree
- REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4
- Coloring 3-power of 3-subdivision of subcubic graph
- On edge colorings of 1-planar graphs without 5-cycles with two chords
- A new upper bound for the independence number of edge chromatic critical graphs
- Edge colorings of planar graphs without 5-cycles with two chords
- Facial parity edge colouring of plane pseudographs
- The size of edge chromatic critical graphs with maximum degree 6
- Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees
- New linear-time algorithms for edge-coloring planar graphs
- Edge-chromatic numbers of Mycielski graphs
- A sufficient condition for edge 6-colorable planar graphs with maximum degree 6
- Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic \(\epsilon \in \{-1, -2, -3\}\)
- Graphs whose edge set can be partitioned into maximum matchings
- On the average degree of critical graphs with maximum degree six
- Edge coloring of graphs with small average degrees
- Extension from precoloured sets of edges
- The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
- Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
- Partitioning edges of a planar graph into linear forests and a matching
- Planar graphs with \(\Delta\geq 8\) are (\(\Delta+1\))-edge-choosable
- Entire colouring of plane graphs
- Edge covering pseudo-outerplanar graphs with forests
- The average degree of edge chromatic critical graphs with maximum degree seven
- Facial entire colouring of plane graphs
- On \(r\)-acyclic edge colorings of planar graphs
- A note on the size of edge-chromatic 4-critical graphs
- (2,1)-total labelling of planar graphs with large maximum degree
- Local neighbor-distinguishing index of graphs
- Randomly colouring graphs (a combinatorial view)
- Edge-colouring seven-regular planar graphs
- A note on class one graphs with maximum degree six
- Coloring non-crossing strings
- Chromatic index of graphs with no cycle with a unique chord
- The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
- On \((p,1)\)-total labelling of planar graphs
- Every planar graph with maximum degree 7 is of class 1
- Sizes of critical graphs with small maximum degrees
- Facially-constrained colorings of plane graphs: a survey
- 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
- Strong edge-colouring of sparse planar graphs
- Strong chromatic index of planar graphs with large girth
- The edge-face coloring of graphs embedded in a surface of characteristic zero
- Coloring edges of graphs embedded in a surface of characteristic zero.
- Remarks on planar edge-chromatic critical graphs
- Finding \(\Delta(\Sigma )\) for a surface \(\Sigma\) of characteristic \(\chi(\Sigma) = -5\)
- The structure of plane graphs with independent crossings and its applications to coloring problems
- Hamiltonian cycles in critical graphs with large maximum degree
- On edge colorings of 1-planar graphs without adjacent triangles
- Edge coloring of graphs embedded in a surface of nonnegative characteristic
- On edge colorings of 1-toroidal graphs
- Facial edge ranking of plane graphs
- Acyclic edge-colouring of planar graphs (extended abstract)
- \([r,s,t]\)-coloring of trees and bipartite graphs
- An introduction to the discharging method via graph coloring
- Graph edge coloring: a survey
- Class I graphs of nonnegative characteristic without special cycles
- An adjacency Lemma for critical multigraphs
- Tree-like distance colouring for planar graphs of sufficient girth
- A sufficient condition for a planar graph to be class I
- The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
- Some sufficient conditions for a planar graph of maximum degree six to be Class 1
- Edge coloring of planar graphs which any two short cycles are adjacent at most once
- Edge-colouring and total-colouring chordless graphs
- Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof
This page was built for publication: Planar graphs of maximum degree seven are Class I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850561)
