A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs

DOI10.1002/net.20424zbMath1219.05058OpenAlexW2077602888MaRDI QIDQ3008921

Celina M. Herrera de Figueiredo, Raphael C. S. Machado

Publication date: 22 June 2011

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20424

zbMATH Keywords

outerplanar graphsgraph decompositionstotal-coloringlist-total-coloringpartial-grids

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph designs and isomorphic decomposition (05C51)

Cites Work

• Unnamed Item
• Unnamed Item
• Total-chromatic number and chromatic index of dually chordal graphs
• Total 4-choosability of series-parallel graphs
• Edge and total choosability of near-outerplanar graphs
• Determining the total colouring number is NP-hard
• The complexity of minimizing wire lengths in VLSI layouts
• Unit-length embedding of binary trees on a square grid
• Characterization of grid graphs
• Total colouring regular bipartite graphs is NP-hard
• List total colorings of series-parallel graphs
• The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\)
• Total chromatic number of one kind of join graphs
• Total chromatic number of planar graphs with maximum degree ten
• On the power of BFS to determine a graph's diameter
• A structure theorem for graphs with no cycle with a unique chord and its consequences
• Edge and total coloring of interval graphs