Pages that link to "Item:Q1850561"
From MaRDI portal
The following pages link to Planar graphs of maximum degree seven are Class I (Q1850561):
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)
- Facial packing edge-coloring of plane graphs (Q313797) (← links)
- Hamiltonian cycles in critical graphs with large maximum degree (Q343761) (← 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-colouring and total-colouring chordless graphs (Q389214) (← 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)
- Facial parity edge colouring of plane pseudographs (Q442406) (← links)
- Edge covering pseudo-outerplanar graphs with forests (Q449118) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Strong chromatic index of planar graphs with large girth (Q472129) (← links)
- Strong edge-colouring of sparse planar graphs (Q477354) (← links)
- Facial edge ranking of plane graphs (Q494424) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles (Q511730) (← links)
- On \((p,1)\)-total labelling of planar graphs (Q512891) (← links)
- Entire colouring of plane graphs (Q651038) (← links)
- Tree-like distance colouring for planar graphs of sufficient girth (Q668079) (← links)
- Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof (Q710613) (← links)
- Coloring non-crossing strings (Q727171) (← 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)
- The edge-face coloring of graphs embedded in a surface of characteristic zero (Q1025544) (← links)
- Coloring edges of graphs embedded in a surface of characteristic zero. (Q1405117) (← 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)
- Extension from precoloured sets of edges (Q1658745) (← links)
- On the precise value of the strong chromatic index of a planar graph with a large girth (Q1671365) (← links)
- The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven (Q1698052) (← 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)
- The structure of plane graphs with independent crossings and its applications to coloring problems (Q1935605) (← links)
- Graphs whose edge set can be partitioned into maximum matchings (Q1952710) (← links)
- The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness (Q2007724) (← links)
