Pages that link to "Item:Q1827800"
From MaRDI portal
The following pages link to Edge choosability of planar graphs without small cycles (Q1827800):
Displaying 23 items.
- Group edge choosability of planar graphs without adjacent short cycles (Q381084) (← links)
- (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles (Q432709) (← links)
- 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)
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles (Q641187) (← links)
- Planar graphs without 4-cycles adjacent to triangles are 4-choosable (Q738863) (← 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 short cycles (Q880873) (← 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)
- Choosability and edge choosability of planar graphs without five cycles (Q1609512) (← 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)
- A structural theorem for planar graphs with some applications (Q2275921) (← links)
- List edge coloring of planar graphs without non-induced 6-cycles (Q2354599) (← links)
- Edge DP-coloring in planar graphs (Q2659224) (← links)
- Circular choosability of planar graphs with large girth. (Q2918609) (← links)
- Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable (Q2947439) (← links)
- (Q4680036) (← links)
- Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles (Q5324109) (← links)
- Sufficient conditions make graphs edge DP-\(\varDelta\)-colorable (Q6660052) (← links)
