Even-power of cycles with many vertices are type 1 total colorable

DOI10.1016/j.entcs.2019.08.065OpenAlexW2978254261WikidataQ113317363 ScholiaQ113317363MaRDI QIDQ2132416

A. Zorzi, Uéverton S. Souza, Celina M. Herrera de Figueiredo, Raphael C. S. Machado

Publication date: 27 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.065

zbMATH Keywords

graph theorygraph algorithmstotal coloringpower of cycle graphs

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Related Items (4)

Results about the total chromatic number and the conformability of some families of circulant graphs ⋮ On total coloring and equitable total coloring of infinite snark families ⋮ Total colorings-a survey ⋮ Compositions, decompositions, and conformability for total coloring on power of cycle graphs

Cites Work

• Unnamed Item
• Total-chromatic number and chromatic index of dually chordal graphs
• Graph minors. III. Planar tree-width
• A result on the total colouring of powers of cycles
• Determining the total colouring number is NP-hard
• Total coloring of rooted path graphs
• Total colourings of graphs
• Chromatic index of graphs with no cycle with a unique chord
• Total colorings of degenerate graphs
• A structure theorem for graphs with no cycle with a unique chord and its consequences

This page was built for publication: Even-power of cycles with many vertices are type 1 total colorable