Total 4-choosability of series-parallel graphs

MaRDI QIDQ870016zbMATH OpenFDO

Authors Douglas R. Woodall

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, http://www.emis.de/journals/EJC/Volume_13/Abstracts/v13i1r97.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Some totally 4-choosable multigraphs
• The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\)
• Total choosability of planar graphs with maximum degree 4
• On \((4,2)\)-choosable graphs
• scientific article; zbMATH DE number 5119225
• The strong fractional choice number of series-parallel graphs
• Acyclic 4-choosability of planar graphs
• A characterization of \((4,2)\)-choosable graphs
• The 4-choosability of planar graphs and cycle adjacency
• On the choice number of complete multipartite graphs with part size four

Cited in

(9)

• Some totally 4-choosable multigraphs
• Edge and total choosability of near-outerplanar graphs
• Total chromatic number of unichord-free graphs
• List total colorings of planar graphs without triangles at small distance
• List total colorings of series-parallel graphs
• Total chromatic number of \{square,unichord\}-free graphs
• The strong fractional choice number of series-parallel graphs
• A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs
• Edge-colouring and total-colouring chordless graphs

This page was built for publication: Total 4-choosability of series-parallel graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870016)