Planar graphs of maximum degree seven are Class I
From MaRDI portal
(Redirected from Publication:1850561)
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
- {{#invoke:WikidataIB|getLink|Q5558480}} scientific article; zbMATH DE number 3273761 (Why is no real title available?)
- {{#invoke:WikidataIB|getLink|Q5931450}} 25 pretty graph colouring problems
- {{#invoke:WikidataIB|getLink|Q5943052}} On improving the edge-face coloring theorem
- {{#invoke:WikidataIB|getLink|Q4242734}} On total 9-coloring planar graphs of maximum degree seven
- {{#invoke:WikidataIB|getLink|Q1369648}} The four-colour theorem
Cited in
(only showing first 100 items - show all)- The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven
- Strong chromatic index of planar graphs with large girth
- Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable
- Facial edge ranking of plane graphs
- Edge colorings of planar graphs without 5-cycles with two chords
- Facial entire colouring of plane graphs
- Randomly colouring graphs (a combinatorial view)
- The structure of plane graphs with independent crossings and its applications to coloring problems
- Hamiltonian cycles in critical graphs with large maximum degree
- On the size of critical graphs with maximum degree 8
- The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
- A sufficient condition for edge 6-colorable planar graphs with maximum degree 6
- Acyclic edge-colouring of planar graphs (extended abstract)
- Facial parity edge colouring of plane pseudographs
- A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems
- Edge coloring of graphs embedded in a surface of nonnegative characteristic
- Some sufficient conditions for a planar graph of maximum degree six to be Class 1
- Graph edge coloring: a survey
- On \((p,1)\)-total labelling of planar graphs
- The edge-face coloring of graphs embedded in a surface of characteristic zero
- Remarks on planar edge-chromatic critical graphs
- Sizes of critical graphs with small maximum degrees
- Partitioning edges of a planar graph into linear forests and a matching
- On the average degree of critical graphs with maximum degree six
- Graphs whose edge set can be partitioned into maximum matchings
- Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees
- Every planar graph with maximum degree 7 is of class 1
- Edge-colouring seven-regular planar graphs
- On \(r\)-acyclic edge colorings of planar graphs
- Facially-constrained colorings of plane graphs: a survey
- (2,1)-total labelling of planar graphs with large maximum degree
- Coloring edges of graphs embedded in a surface of characteristic zero.
- New linear-time algorithms for edge-coloring planar graphs
- On edge colorings of 1-toroidal graphs
- Edge coloring of graphs with small average degrees
- Class I graphs of nonnegative characteristic without special cycles
- Edge covering pseudo-outerplanar graphs with forests
- Edge-chromatic numbers of Mycielski graphs
- An adjacency Lemma for critical multigraphs
- Tree-like distance colouring for planar graphs of sufficient girth
- Planar graphs with \(\Delta\geq 8\) are (\(\Delta+1\))-edge-choosable
- Edge coloring of planar graphs which any two short cycles are adjacent at most once
- Edge-colouring and total-colouring chordless graphs
- A note on class one graphs with maximum degree six
- Coloring non-crossing strings
- Face-degree bounds for planar critical graphs
- Chromatic index of graphs with no cycle with a unique chord
- Facial packing edge-coloring of plane graphs
- On edge colorings of 1-planar graphs without adjacent triangles
- Entire colouring of plane graphs
- The average degree of edge chromatic critical graphs with maximum degree seven
- Finding \(\Delta(\Sigma )\) for a surface \(\Sigma\) of characteristic \(\chi(\Sigma) = -5\)
- Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof
- Extension from precoloured sets of edges
- \([r,s,t]\)-coloring of trees and bipartite graphs
- An introduction to the discharging method via graph coloring
- The size of edge chromatic critical graphs with maximum degree 6
- A note on the size of edge-chromatic 4-critical graphs
- Local neighbor-distinguishing index of graphs
- The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\)
- A sufficient condition for a planar graph to be class I
- Strong edge-colouring of sparse planar graphs
- A sufficient condition for edge chromatic critical graphs to be Hamiltonian -- an approach to Vizing's 2-factor conjecture
- Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic \(\epsilon \in \{-1, -2, -3\}\)
- Complexity-separating graph classes for vertex, edge and total colouring
- Facial visibility in edge colored plane graphs
- Signed planar graphs with \(\Delta \geq 8\) are \(\Delta\)-edge-colorable
- Finding \(\Delta (\Sigma)\) for a surface \(\Sigma \) of characteristic \(-6\) and \(-7\)
- Subcubic planar graphs of girth 7 are class I
- Recent progress on strong edge-coloring of graphs
- Incidence coloring -- cold cases
- Total-coloring of sparse graphs with maximum degree 6
- Weakening total coloring conjecture and Hadwiger's conjecture on total graphs
- A sufficient condition for an IC-planar graph to be class 1
- Conflict-free incidence coloring of outer-1-planar graphs
- Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable
- Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles
- List-edge-colouring planar graphs with precoloured edges
- The edge colorings of \(K_5\)-minor free graphs
- On the independence number of edge chromatic critical graphs
- On the precise value of the strong chromatic index of a planar graph with a large girth
- On edge colorings of 1-planar graphs without 5-cycles with two chords
- On the maximum number of edges in planar graphs of bounded degree and matching number
- Solution of Vizing's problem on interchanges for the case of graphs with maximum degree 4 and related results
- Chromatic index, treewidth and maximum degree
- scientific article; zbMATH DE number 7790331 (Why is no real title available?)
- On the equitable edge-coloring of 1-planar graphs and planar graphs
- Facial rainbow edge-coloring of plane graphs
- Chromatic index, treewidth and maximum degree
- Edge colorings of planar graphs without 6-cycles with three chords
- Coloring 3-power of 3-subdivision of subcubic graph
- REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4
- Vizing's coloring algorithm and the fan number
- Facial rainbow edge-coloring of simple 3-connected plane graphs
- Finding \(\Delta(\Sigma)\) for a surface \(\Sigma\) of characteristic \(-4\)
- The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness
- A survey on the cyclic coloring and its relaxations
- A new upper bound for the independence number of edge chromatic critical graphs
- Edge coloring of planar graphs without adjacent 7-cycles
- Edge-partition and star chromatic index
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)
