Pages that link to "Item:Q975488"
From MaRDI portal
The following pages link to List edge and list total colorings of planar graphs without short cycles (Q975488):
Displaying 13 items.
- List total coloring of pseudo-outerplanar graphs (Q393451) (← links)
- A note on edge-choosability of planar graphs without intersecting 4-cycles (Q545596) (← links)
- Total coloring of planar graphs without 6-cycles (Q617651) (← links)
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles (Q641187) (← links)
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable (Q708386) (← links)
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles (Q1043815) (← links)
- List-edge-coloring of planar graphs without 6-cycles with three chords (Q1702837) (← links)
- List total colorings of planar graphs without triangles at small distance (Q1942193) (← 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)
- A note on list edge and list total coloring of planar graphs without adjacent short cycles (Q2440495) (← links)
- Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)
