Pages that link to "Item:Q1025481"
From MaRDI portal
The following pages link to Edge choosability of planar graphs without 5-cycles with a chord (Q1025481):
Displaying 9 items.
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles (Q641187) (← links)
- Edge choosability of planar graphs without short cycles (Q880873) (← links)
- Edge-choosability of planar graphs without non-induced 5-cycles (Q976112) (← links)
- Choosability and edge choosability of planar graphs without five cycles (Q1609512) (← links)
- Planar graphs without chordal 5-cycles are 2-good (Q1743499) (← links)
- 2-connected chordal graphs and line graphs are \((1,5)\)-choosable (Q2225433) (← links)
- On group choosability of total graphs (Q2376095) (← links)
- Graphs of degree 4 are 5-edge-choosable (Q4718735) (← links)
- Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)