Pages that link to "Item:Q1840829"
From MaRDI portal
The following pages link to Choosability, edge choosability and total choosability of outerplane graphs (Q1840829):
Displaying 25 items.
- List total coloring of pseudo-outerplanar graphs (Q393451) (← links)
- Minimum total coloring of planar graph (Q475814) (← links)
- A note on edge-choosability of planar graphs without intersecting 4-cycles (Q545596) (← links)
- List edge and list total coloring of 1-planar graphs (Q692658) (← links)
- On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability (Q854811) (← links)
- List edge and list total colorings of planar graphs without 4-cycles (Q861265) (← links)
- List edge and list total colorings of planar graphs without short cycles (Q975488) (← links)
- Edge-choosability of planar graphs without non-induced 5-cycles (Q976112) (← 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)
- Some results on distance two labelling of outerplanar graphs (Q1036889) (← links)
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles (Q1045095) (← links)
- List-edge-coloring of planar graphs without 6-cycles with three chords (Q1702837) (← links)
- List total colorings of series-parallel graphs (Q1775015) (← links)
- List total colorings of planar graphs without triangles at small distance (Q1942193) (← links)
- List edge coloring of outer-1-planar graphs (Q2023746) (← links)
- List edge colorings of planar graphs without adjacent 7-cycles (Q2035728) (← links)
- The list edge coloring and list total coloring of planar graphs with maximum degree at least 7 (Q2194528) (← links)
- List edge coloring of planar graphs without 6-cycles with two chords (Q2214317) (← 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)
- Edge DP-coloring in planar graphs (Q2659224) (← links)
- Edge-group choosability of outerplanar and near-outerplanar graphs (Q4997221) (← links)
- List edge and list total coloring of planar graphs without intersecting 8-cycles (Q5034571) (← links)
- Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)
