On the chromatic edge stability number of graphs

DOI10.1007/s00373-018-1972-yzbMath1402.05072OpenAlexW2901929679WikidataQ128959652 ScholiaQ128959652MaRDI QIDQ1756117

Arnfried Kemnitz, Nazanin Movarraei, Massimiliano Marangio

Publication date: 11 January 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-018-1972-y

zbMATH Keywords

chromatic numbercoloringchromatic bondage numberchromatic edge stability number

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (11)

On the chromatic vertex stability number of graphs ⋮ On the Total Chromatic Edge Stability Number and the Total Chromatic Subdivision Number of Graphs ⋮ Critical graphs for the chromatic edge-stability number ⋮ A Gallai’s Theorem type result for the edge stability of graphs ⋮ On the chromatic edge stability index of graphs ⋮ On the edge chromatic vertex stability number of graphs ⋮ On the vertex stability numbers of graphs ⋮ On critical graphs for the chromatic edge-stability number ⋮ Nordhaus-Gaddum and other bounds for the chromatic edge-stability number ⋮ On the \(\rho \)-edge stability number of graphs ⋮ SOME EXTREMAL RESULTS ON THE CHROMATIC STABILITY INDEX

Cites Work

• The bipartite edge frustration of extension of splice and link graphs
• Computing the bipartite edge frustration of fullerene graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: On the chromatic edge stability number of graphs