Nordhaus–Gaddum and other bounds for the chromatic edge-stability number
Authors:
- Saieed AkbariSASaieed Akbari
- Sandi KlavžarSKSandi Klavžar
- Nazanin MovarraeiNMNazanin Movarraei
- Mina NahviMNMina Nahvi
- 1 February 2020
- journal article
- research article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 84
Abstract
No abstract availableFunding Information
- The Slovenian Research and Innovation Agency (J1-1693)
- The Slovenian Research and Innovation Agency (N1-0095)
- The Slovenian Research and Innovation Agency (J1-9109)
- The Slovenian Research and Innovation Agency (P1-0297)
- Center for Outcomes Research and Evaluation, Yale School of Medicine
- Yazd University
- Iran National Science Foundation (96004167)
This publication has 14 references indexed in Scilit:
- Improving a Nordhaus–Gaddum type bound for total domination using an algorithm involving vertex disjoint starsDiscrete Applied Mathematics, 2017
- Nordhaus–Gaddum bounds for total Roman dominationJournal of Combinatorial Optimization, 2017
- Total weight choosability of Mycielski graphsJournal of Combinatorial Optimization, 2015
- Bondage Numbers of Mycielski GraphsBulletin of the Malaysian Mathematical Sciences Society, 2015
- Bipartizing fullerenesEuropean Journal of Combinatorics, 2012
- The bipartite edge frustration of graphs under subdivided edges and their related sumsComputers & Mathematics with Applications, 2011
- The bipartite edge frustration of extension of splice and link graphsApplied Mathematics Letters, 2010
- Bipartite subgraphs of triangle-free subcubic graphsJournal of Combinatorial Theory, Series B, 2009
- Computing the bipartite edge frustration of fullerene graphsDiscrete Applied Mathematics, 2007
- Bipartite Subgraphs of Graphs with Maximum Degree ThreeGraphs and Combinatorics, 1999