Choosability, edge choosability and total choosability of outerplane graphs
From MaRDI portal
Publication:1840829
DOI10.1006/eujc.2000.0430zbMath0972.05021OpenAlexW1986620181MaRDI QIDQ1840829
Publication date: 13 November 2001
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.2000.0430
Related Items (25)
List edge and list total coloring of planar graphs without intersecting 8-cycles ⋮ On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability ⋮ List edge and list total colorings of planar graphs without 4-cycles ⋮ Edge-group choosability of outerplanar and near-outerplanar graphs ⋮ Edge DP-coloring in planar graphs ⋮ List total coloring of pseudo-outerplanar graphs ⋮ The list edge coloring and list total coloring of planar graphs with maximum degree at least 7 ⋮ List total colorings of planar graphs without triangles at small distance ⋮ List-edge-coloring of planar graphs without 6-cycles with three chords ⋮ A note on list edge and list total coloring of planar graphs without adjacent short cycles ⋮ List edge coloring of planar graphs without 6-cycles with two chords ⋮ Minimum total coloring of planar graph ⋮ List edge and list total coloring of 1-planar graphs ⋮ A note on edge-choosability of planar graphs without intersecting 4-cycles ⋮ List edge and list total colorings of planar graphs without short cycles ⋮ Edge-choosability of planar graphs without non-induced 5-cycles ⋮ List total colorings of series-parallel graphs ⋮ List edge coloring of outer-1-planar graphs ⋮ Edge-choosability of planar graphs without adjacent triangles or without 7-cycles ⋮ List edge colorings of planar graphs without adjacent 7-cycles ⋮ Edge choosability of planar graphs without 5-cycles with a chord ⋮ Some results on distance two labelling of outerplanar graphs ⋮ Total colorings and list total colorings of planar graphs without intersecting 4-cycles ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges ⋮ List edge coloring of planar graphs without non-induced 6-cycles
Cites Work
- List colourings of planar graphs
- List-colourings of graphs
- A new upper bound for the list chromatic number
- Colorings and orientations of graphs
- A solution to a colouring problem of P. Erdős
- Edge-choosability in line-perfect multigraphs
- Edge-choosability of multicircuits
- Every planar graph is 5-choosable
- List edge and list total colourings of multigraphs
- The list chromatic index of a bipartite multigraph
- 3-list-coloring planar graphs of girth 5
- List edge colourings of some 1-factorable multigraphs
- Every Planar Map is Four Colorable
- Some upper bounds on the total and list chromatic numbers of multigraphs
- New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Choosability, edge choosability and total choosability of outerplane graphs
