Pages that link to "Item:Q1827800"
From MaRDI portal
The following pages link to Edge choosability of planar graphs without small cycles (Q1827800):
Displaying 12 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)
- On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability (Q854811) (← 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)
- List-edge-coloring of planar graphs without 6-cycles with three chords (Q1702837) (← 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)
- Edge DP-coloring in planar graphs (Q2659224) (← links)
- Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable (Q2947439) (← links)
