scientific article; zbMATH DE number 2230202

zbMath1075.05528MaRDI QIDQ5708488

Célia Picinin de Mello, C. N. Campos

Publication date: 18 November 2005

Full work available at URL: http://www.sciencedirect.com/science/journal/15710653

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

On colorings of graph fractional powers ⋮ Total and fractional total colourings of circulant graphs ⋮ On the connectivity of k-distance graphs

Cites Work

• Determining the total colouring number is NP-hard
• Total colouring regular bipartite graphs is NP-hard
• Total colourings of graphs
• Coloração Total do C²n
• The Colour Numbers of Complete Graphs

This page was built for publication: