Pages that link to "Item:Q1759890"
From MaRDI portal
The following pages link to A sufficient condition for a plane graph with maximum degree 6 to be class 1 (Q1759890):
Displaying 18 items.
- Face-degree bounds for planar critical graphs (Q311518) (← links)
- Edge colorings of planar graphs without 5-cycles with two chords (Q391789) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Plane graphs with maximum degree 6 are edge-face 8-colorable (Q742598) (← links)
- A sufficient condition for edge 6-colorable planar graphs with maximum degree 6 (Q832998) (← links)
- Remarks on planar edge-chromatic critical graphs (Q906449) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- Edge colorings of planar graphs without 6-cycles with three chords (Q1746732) (← links)
- Planar graphs of maximum degree seven are Class I (Q1850561) (← 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)
- A survey on the cyclic coloring and its relaxations (Q2214302) (← links)
- Planar graphs of maximum degree 6 and without adjacent 8-cycles are 6-edge-colorable (Q2230029) (← links)
- Some sufficient conditions for a planar graph of maximum degree six to be Class 1 (Q2497482) (← links)
- A note on class one graphs with maximum degree six (Q2497484) (← links)
- Finding \(\Delta(\Sigma)\) for a surface \(\Sigma\) of characteristic \(-4\) (Q2833122) (← links)
- Facial rainbow edge-coloring of simple 3-connected plane graphs (Q3298111) (← links)
- Every planar graph with maximum degree 7 is of class 1 (Q5935607) (← links)
