Edge and total choosability of near-outerplanar graphs
From MaRDI portal
Publication:870017
zbMath1115.05032MaRDI QIDQ870017
Douglas R. Woodall, Timothy J. Hetherington
Publication date: 12 March 2007
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/127625
Related Items (10)
Total chromatic number of {square,unichord}-free graphs ⋮ On group choosability of total graphs ⋮ Edge-group choosability of outerplanar and near-outerplanar graphs ⋮ Edge-colouring and total-colouring chordless graphs ⋮ Total chromatic number of unichord-free graphs ⋮ Edge covering pseudo-outerplanar graphs with forests ⋮ A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs ⋮ List edge coloring of outer-1-planar graphs ⋮ Entire choosability of near-outerplane graphs ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges
This page was built for publication: Edge and total choosability of near-outerplanar graphs
