A result on the total colouring of powers of cycles
From MaRDI portal
Publication:875593
DOI10.1016/j.dam.2006.08.010zbMath1124.05031OpenAlexW2009349978MaRDI QIDQ875593
C. N. Campos, Célia Picinin 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
Related Items (20)
On adjacent-vertex-distinguishing total colourings of powers of cycles, hypercubes and lattice graphs ⋮ Even-power of cycles with many vertices are type 1 total colorable ⋮ On total coloring of some classes of regular graphs ⋮ Results about the total chromatic number and the conformability of some families of circulant graphs ⋮ Total colorings-a survey ⋮ On the AVDTC of Sierpiński-type graphs ⋮ On the conformability of regular line graphs ⋮ On star and biclique edge-colorings ⋮ Total chromatic number of unichord-free graphs ⋮ Computing square roots of trivially perfect and threshold graphs ⋮ The hunting of a snark with total chromatic number 5 ⋮ Biclique-colouring verification complexity and biclique-colouring power graphs ⋮ On total chromatic number of direct product graphs ⋮ Partitioning a graph into convex sets ⋮ Colouring clique-hypergraphs of circulant graphs ⋮ Vertex-, edge-, and total-colorings of Sierpiński-like graphs ⋮ Equitable total coloring of \(C_m\square C_n\) ⋮ Colouring clique-hypergraphs of circulant graphs ⋮ Compositions, decompositions, and conformability for total coloring on power of cycle graphs ⋮ Total colorings of circulant graphs
Cites Work
- Total-chromatic number and chromatic index of dually chordal graphs
- Determining the total colouring number is NP-hard
- Total colouring regular bipartite graphs is NP-hard
- On planarity and colorability of circulant graphs
- Total colourings of graphs
- Coloração Total do C²n
- The Colour Numbers of Complete Graphs
This page was built for publication: A result on the total colouring of powers of cycles
