Choosability, edge choosability and total choosability of outerplane graphs
type: Item
instance of: scholarly article
title: Choosability, edge choosability and total choosability of outerplane graphs
zbMATH Open document ID: 0972.05021
author: Ko-Wei Lih
author: Weifan Wang
published in: European Journal of Combinatorics
publication date: 2001-11-13T00:00:00Z
review text: If each vertex \(v\) of a graph \(G\) is assigned a list \(L(v)\) of possible colors and \(G\) has a proper coloring \(\sigma\) such that \(\sigma(v)\in L(v)\) for all \(v\), then we say that \(G\) is \(L\)-colorable. If \(|L(v)|= k\) for all \(v\) and if \(G\) is \(L\)-colorable for each such \(L\), then \(G\) is said to be \(k\)-choosable. By considering colorings for \(E(G)\) and for \(E(G)\cup V(G)\) we can define parallel notions such as edge choosability and total choosability. Several relations for these quantities and, in particular, the list edge coloring conjecture for outerplane graphs are proved.
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1567135
zbMATH Keywords: edge choosability
zbMATH Keywords: total choosability
zbMATH Keywords: list edge coloring conjecture
zbMATH Keywords: outerplane graphs
reviewed by: Dragoš Cvetković
MaRDI profile type: Publication
full work available at URL: eujc.2000.0430
OpenAlex ID: W1986620181
cites work: Colorings and orientations of graphs
cites work: Every Planar Map is Four Colorable
cites work: List-colourings of graphs
cites work: A new upper bound for the list chromatic number
cites work: Q4846547
cites work: List edge and list total colourings of multigraphs
cites work: List edge colourings of some 1-factorable multigraphs
cites work: Q3922703
cites work: A solution to a colouring problem of P. Erdős
cites work: The list chromatic index of a bipartite multigraph
cites work: Some upper bounds on the total and list chromatic numbers of multigraphs
cites work: New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
cites work: Q4511485
cites work: Edge-choosability in line-perfect multigraphs
cites work: Every planar graph is 5-choosable
cites work: 3-list-coloring planar graphs of girth 5
cites work: Q3115277
cites work: List colourings of planar graphs
cites work: Edge-choosability of multicircuits
cites work: Q3815316
DOI: 10.1006/EUJC.2000.0430
Recommended article: Edge and total choosability of near-outerplanar graphs
Recommended article: Entire choosability of near-outerplane graphs
Recommended article: Edge-group choosability of outerplanar and near-outerplanar graphs
Recommended article: Q3621528
Recommended article: Free choosability of outerplanar graphs
Recommended article: Q3190529
Recommended article: Edge (m,k)-choosability of graphs
Recommended article: Choosability of planar graphs
Recommended article: The edge-face choosability of plane graphs
Recommended article: Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
description: scientific article; zbMATH DE number 1567135