Pages that link to "Item:Q5935607"
From MaRDI portal
The following pages link to Every planar graph with maximum degree 7 is of class 1 (Q5935607):
Displaying 50 items.
- A note on the size of edge-chromatic 4-critical graphs (Q294519) (← links)
- Face-degree bounds for planar critical graphs (Q311518) (← links)
- On edge colorings of 1-toroidal graphs (Q353624) (← links)
- Class I graphs of nonnegative characteristic without special cycles (Q377914) (← links)
- Edge coloring of planar graphs which any two short cycles are adjacent at most once (Q385973) (← links)
- Edge colorings of planar graphs without 5-cycles with two chords (Q391789) (← links)
- Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees (Q396727) (← links)
- On the average degree of critical graphs with maximum degree six (Q409377) (← links)
- Edge-chromatic numbers of Mycielski graphs (Q409467) (← links)
- On edge colorings of 1-planar graphs without adjacent triangles (Q413262) (← links)
- On \(r\)-acyclic edge colorings of planar graphs (Q442224) (← links)
- Strong edge-colouring of sparse planar graphs (Q477354) (← links)
- Some sufficient conditions for 1-planar graphs to be class 1 (Q484318) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Entire colouring of plane graphs (Q651038) (← links)
- A sufficient condition for edge 6-colorable planar graphs with maximum degree 6 (Q832998) (← links)
- A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems (Q845924) (← links)
- Sizes of critical graphs with small maximum degrees (Q882787) (← links)
- Facial entire colouring of plane graphs (Q898120) (← links)
- Remarks on planar edge-chromatic critical graphs (Q906449) (← links)
- Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic \(\epsilon \in \{-1, -2, -3\}\) (Q933675) (← links)
- An adjacency Lemma for critical multigraphs (Q942112) (← links)
- \([r,s,t]\)-coloring of trees and bipartite graphs (Q960923) (← links)
- On the size of critical graphs with maximum degree 8 (Q982631) (← links)
- On the size of edge-coloring critical graphs with maximum degree 4 (Q998479) (← links)
- The edge-face coloring of graphs embedded in a surface of characteristic zero (Q1025544) (← links)
- New results on chromatic index critical graphs (Q1043537) (← links)
- Edge coloring of graphs with small maximum degrees (Q1044957) (← links)
- Edge coloring of graphs with small average degrees (Q1420599) (← links)
- List-edge-colouring planar graphs with precoloured edges (Q1621065) (← links)
- Edge coloring of planar graphs without adjacent 7-cycles (Q1643159) (← links)
- On edge colorings of 1-planar graphs without 5-cycles with two chords (Q1717181) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- Edge colorings of planar graphs without 6-cycles with three chords (Q1746732) (← links)
- Average degrees of edge-chromatic critical graphs (Q1999729) (← links)
- The edge colorings of \(K_5\)-minor free graphs (Q2022144) (← links)
- A sufficient condition for an IC-planar graph to be class 1 (Q2053694) (← links)
- Subcubic planar graphs of girth 7 are class I (Q2144599) (← links)
- Hamiltonicity of edge-chromatic critical graphs (Q2182200) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable (Q2230029) (← links)
- Upper bounds on the maximum degree of class two graphs on surfaces (Q2286600) (← links)
- Edge-partition and star chromatic index (Q2335139) (← links)
- Edge coloring of graphs embedded in a surface of nonnegative characteristic (Q2401779) (← links)
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
- Finding \(\Delta (\Sigma)\) for a surface \(\Sigma \) of characteristic \(-6\) and \(-7\) (Q2409528) (← links)
- On the equitable edge-coloring of 1-planar graphs and planar graphs (Q2409529) (← links)
- On the size of edge chromatic 5-critical graphs (Q2409770) (← links)
- A sufficient condition for a planar graph to be class I (Q2456359) (← links)
- The average degree of an edge-chromatic critical graph (Q2470447) (← links)
