Pages that link to "Item:Q2895387"
From MaRDI portal
The following pages link to Edge-choosability of planar graphs without chordal 6-cycles (Q2895387):
Displaying 12 items.
- Acyclic 6-choosability of planar graphs without adjacent short cycles (Q476645) (← links)
- A note on edge-choosability of planar graphs without intersecting 4-cycles (Q545596) (← links)
- Edge choosability of planar graphs without short cycles (Q880873) (← 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)
- Planar graphs without chordal 6-cycles are 4-choosable (Q1752596) (← links)
- Injective choosability of subcubic planar graphs with girth 6 (Q2012551) (← links)
- List edge coloring of planar graphs without 6-cycles with two chords (Q2214317) (← links)
- The list linear arboricity of planar graphs with 7-cycles containing at most two chords (Q2286100) (← links)
- List edge coloring of planar graphs without non-induced 6-cycles (Q2354599) (← links)
- Vertex arboricity of planar graphs without chordal 6-cycles (Q2868169) (← links)