Total 4-choosability of series-parallel graphs

zbMATH Open1113.05040MaRDI QIDQ870016FDOQ870016

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

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)

Cited In (6)

• Total chromatic number of unichord-free graphs
• List total colorings of planar graphs without triangles at small distance
• 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

Recommendations

• Title not available (Why is that?) 👍 👎
• The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\) 👍 👎
• Total choosability of planar graphs with maximum degree 4 👍 👎
• Acyclic 4-choosability of planar graphs 👍 👎
• On the choice number of complete multipartite graphs with part size four 👍 👎
• The 4-choosability of planar graphs and cycle adjacency 👍 👎
• Some totally 4-choosable multigraphs 👍 👎
• The strong fractional choice number of series-parallel graphs 👍 👎
• A characterization of (4,2)‐choosable graphs 👍 👎
• On (4, 2)‐Choosable 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)