scientific article; zbMATH DE number 2230202

MaRDI QIDQ5708488zbMATH OpenFDO

Authors C. N. Campos, Célia P. de Mello

Publication date 18 November 2005

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

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(3)

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

This page was built for publication:

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