On the Chromatic Edge Stability Number of Graphs-Reference-Cited by-同舟云学术

On the Chromatic Edge Stability Number of Graphs

Published:2018-11 Issue:6 Volume:34 Page:1539-1551
ISSN:0911-0119
Container-title:Graphs and Combinatorics
language:en
Short-container-title:Graphs and Combinatorics

Author:

Kemnitz Arnfried,Marangio Massimiliano,Movarraei Nazanin

Publisher

Springer Science and Business Media LLC

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Link

http://link.springer.com/article/10.1007/s00373-018-1972-y/fulltext.html

Reference4 articles.

1. Arumugam, S., Sahul Hamid, I., Muthukamatchi, A.: Independent domination and graph colorings. Lect. Note Ser. Math. (Ramanujan Mathematical Society) 7, 195–203 (2008)

2. Došlić, T., Vukičević, D.: Computing the bipartite edge frustration of fullerene graphs. Discrete Appl. Math. 155, 1294–1301 (2007)

3. Staton, W.: Edge deletions and the chromatic number. ARS Combin. 10, 103–106 (1980)

4. Yarahmadi, Z.: The bipartite edge frustration of extension of splice and link graphs. Appl. Math. Lett. 23, 1077–1081 (2010)

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the vertex stability numbers of graphs;Discrete Applied Mathematics;2024-02

2. A Gallai’s Theorem type result for the edge stability of graphs;Discrete Mathematics Letters;2023-08-11

3. On the chromatic edge stability index of graphs;European Journal of Combinatorics;2023-06

4. On critical graphs for the chromatic edge-stability number;Discrete Mathematics;2023-05

5. On the edge chromatic vertex stability number of graphs;AKCE International Journal of Graphs and Combinatorics;2022-11-28