Compositions, decompositions, and conformability for total coloring on power of cycle graphs
From MaRDI portal
Publication:2091818
DOI10.1016/j.dam.2021.06.012zbMath1502.05079OpenAlexW3179231235MaRDI QIDQ2091818
A. Zorzi, Uéverton S. Souza, Leandro M. Zatesko, Raphael C. S. Machado, Celina M. H. Figueiredo
Publication date: 2 November 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.06.012
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
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
Cites Work
- Unnamed Item
- Total-chromatic number and chromatic index of dually chordal graphs
- The total chromatic number of graphs having large maximum degree
- 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 colouring regular bipartite graphs is NP-hard
- Total coloring of rooted path graphs
- Total colourings of graphs
- Even-power of cycles with many vertices are type 1 total colorable
- Chromatic index of graphs with no cycle with a unique chord
- Total colorings of degenerate graphs
- On the total coloring of certain graphs
- Total Colourings of Graphs
- A structure theorem for graphs with no cycle with a unique chord and its consequences