Pages that link to "Item:Q1702837"
From MaRDI portal
The following pages link to List-edge-coloring of planar graphs without 6-cycles with three chords (Q1702837):
Displaying 10 items.
- Minimum choosability of planar graphs (Q724728) (← links)
- List edge colorings of planar graphs without adjacent 7-cycles (Q2035728) (← 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)
- Edge DP-coloring in planar graphs (Q2659224) (← links)
- Structural properties and edge choosability of planar graphs without 6-cycles (Q2731587) (← links)
- List edge and list total colorings of planar graphs without 6-cycles with chord (Q2880475) (← links)
- Edge-choosability of planar graphs without chordal 6-cycles (Q2895387) (← links)
- List edge and list total coloring of planar graphs without intersecting 8-cycles (Q5034571) (← links)