A result on the total colouring of powers of cycles

DOI10.1016/J.DAM.2006.08.010MaRDI QIDQ875593zbMATH OpenOpenAlexFDO

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

Publication date 13 April 2007

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2006.08.010

zbMATH Keywords

total colouringpowers of cyclestotal chromatic numbertotal colouring conjecture

Mathematics Subject Classification ID

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

Recommendations

• Total colorings of circulant graphs
• Compositions, decompositions, and conformability for total coloring on power of cycle graphs
• scientific article; zbMATH DE number 1990691
• scientific article; zbMATH DE number 2077682
• The 1,2-conjecture for powers of cycles

Cites work

• Coloração Total do C²n
• Determining the total colouring number is NP-hard
• On planarity and colorability of circulant graphs
• The Colour Numbers of Complete Graphs
• Total colouring regular bipartite graphs is NP-hard
• Total colourings of graphs
• Total-chromatic number and chromatic index of dually chordal graphs

Cited in

(23)

• On star and biclique edge-colorings
• On total chromatic number of direct product graphs
• Total colorings-a survey
• On the AVDTC of Sierpiński-type graphs
• Total chromatic number of unichord-free graphs
• Vertex-, edge-, and total-colorings of Sierpiński-like graphs
• On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs
• Total colorings of circulant graphs
• A proof of a conjecture on multiset coloring the powers of cycles
• On the conformability of regular line graphs
• THE HULL NUMBER OF POWERS OF CYCLES
• Computing square roots of trivially perfect and threshold graphs
• On total coloring of some classes of regular graphs
• The hunting of a snark with total chromatic number 5
• Colouring clique-hypergraphs of circulant graphs
• Colouring clique-hypergraphs of circulant graphs
• Equitable total coloring of \(C_m\square C_n\)
• Results about the total chromatic number and the conformability of some families of circulant graphs
• An optimal algorithm to totally color some powers of cycle graphs
• Biclique-colouring verification complexity and biclique-colouring power graphs
• Partitioning a graph into convex sets
• Compositions, decompositions, and conformability for total coloring on power of cycle graphs
• Even-power of cycles with many vertices are type 1 total colorable

This page was built for publication: A result on the total colouring of powers of cycles

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