On the Total Chromatic Edge Stability Number and the Total Chromatic Subdivision Number of Graphs

DOI10.47443/dml.2021.111OpenAlexW4213105230MaRDI QIDQ5054777

Massimiliano Marangio, Arnfried Kemnitz

Publication date: 9 December 2022

Published in: Discrete Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.47443/dml.2021.111

zbMATH Keywords

total chromatic numbertotal coloringtotal chromatic edge stability numbertotal chromatic subdivision number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

A Gallai’s Theorem type result for the edge stability of graphs, On the vertex stability numbers of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Domination alteration sets in graphs
• A total-chromatic number analogue of Plantholt's theorem
• The total chromatic number of nearly complete bipartite graphs
• On the chromatic edge stability number of graphs
• Total colourings of graphs
• Nordhaus-Gaddum and other bounds for the chromatic edge-stability number
• On the \(\rho \)-edge stability number of graphs
• Critical graphs for the chromatic edge-stability number