Total 4-choosability of series-parallel graphs
From MaRDI portal
Publication:870016
zbMath1113.05040MaRDI QIDQ870016
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/127475
Related Items (5)
Total chromatic number of {square,unichord}-free graphs ⋮ Edge-colouring and total-colouring chordless graphs ⋮ List total colorings of planar graphs without triangles at small distance ⋮ Total chromatic number of unichord-free graphs ⋮ A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs
This page was built for publication: Total 4-choosability of series-parallel graphs
