On the chromatic edge stability index of graphs

DOI10.1016/j.ejc.2023.103690zbMath1518.05053arXiv2108.10657OpenAlexW3194142735MaRDI QIDQ6116405

Arash Beikmohammadi, Nazanin Movarraei, Boštjan Brešar, Tanja Gologranc, Mohammad Mahdi Habibollahi, Saieed Akbari

Publication date: 18 July 2023

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.10657

zbMATH Keywords

matchingedge coloringchromatic index

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Tight bounds on the chromatic edge stability index of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some criteria for a graph to be class 1
• On the perfect matchings of near regular graphs
• Balanced edge colorings.
• Graph edge coloring: a survey
• On the chromatic edge stability number of graphs
• Nordhaus-Gaddum and other bounds for the chromatic edge-stability number
• Critical graphs for the chromatic edge-stability number
• Vizing's 2-factor conjecture involving toughness and maximum degree conditions
• The NP-Completeness of Edge-Coloring

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