Edge and total choosability of near-outerplanar graphs
From MaRDI portal
Publication:870017
zbMATH Open1115.05032MaRDI QIDQ870017FDOQ870017
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Cited In (15)
- The edge-face choosability of plane graphs
- Edge covering pseudo-outerplanar graphs with forests
- Total chromatic number of unichord-free graphs
- Entire choosability of near-outerplane graphs
- Defective choosability of graphs with no edge-plus-independent-set minor
- (\(1,\lambda\))-embedded graphs and the acyclic edge choosability
- Choosability, edge choosability and total choosability of outerplane graphs
- Two Chromatic Conjectures: One for Vertices and One for Edges
- On group choosability of total graphs
- Total chromatic number of \{square,unichord\}-free graphs
- Edge-group choosability of outerplanar and near-outerplanar graphs
- List edge coloring of outer-1-planar graphs
- A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs
- Title not available (Why is that?)
- Edge-colouring and total-colouring chordless graphs
Recommendations
- Total 4-choosability of series-parallel graphs 👍 👎
- Entire choosability of near-outerplane graphs 👍 👎
- Edge-face choosability of near-outerplane graphs 👍 👎
- Choosability, edge choosability and total choosability of outerplane graphs 👍 👎
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles 👍 👎
This page was built for publication: Edge and total choosability of near-outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870017)
