scientific article; zbMATH DE number 2230202

zbMATH Open1075.05528MaRDI QIDQ5708488FDOQ5708488

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

Publication date: 18 November 2005

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

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• On the connectivity of k-distance graphs
• On colorings of graph fractional powers
• 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)