Pages that link to "Item:Q4718735"

The following pages link to Graphs of degree 4 are 5-edge-choosable (Q4718735):

Displaying 20 items.

• An introduction to the discharging method via graph coloring (Q507506) (← links)
• A note on edge-choosability of planar graphs without intersecting 4-cycles (Q545596) (← links)
• List edge and list total coloring of 1-planar graphs (Q692658) (← links)
• Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof (Q710613) (← links)
• Some colouring problems for Paley graphs (Q817760) (← links)
• Edge-choosability of planar graphs without non-induced 5-cycles (Q976112) (← links)
• Structural properties and edge choosability of planar graphs without 4-cycles (Q998462) (← links)
• Edge-choosability of planar graphs without adjacent triangles or without 7-cycles (Q998494) (← links)
• Edge choosability of planar graphs without 5-cycles with a chord (Q1025481) (← links)
• The edge-face coloring of graphs embedded in a surface of characteristic zero (Q1025544) (← links)
• Choosability and edge choosability of planar graphs without five cycles (Q1609512) (← links)
• Extension from precoloured sets of edges (Q1658745) (← links)
• List-edge-coloring of planar graphs without 6-cycles with three chords (Q1702837) (← links)
• Entire coloring of graphs embedded in a surface of nonnegative characteristic (Q1756114) (← links)
• Edge choosability of planar graphs without small cycles (Q1827800) (← links)
• The edge-face choosability of plane graphs (Q1883606) (← links)
• The list edge coloring and list total coloring of planar graphs with maximum degree at least 7 (Q2194528) (← links)
• List edge coloring of planar graphs without 6-cycles with two chords (Q2214317) (← links)
• List edge coloring of planar graphs without non-induced 6-cycles (Q2354599) (← links)
• Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable (Q2947439) (← links)