Partition of graphs with maximum degree ratio
- 7 May 2025
- journal article
- research article
- Published by Springer Nature in Annals of Operations Research
- p. 1-12
Abstract
No abstract availableKeywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and KernelizationAlgorithmica, 2021
- On partitions of -free graphs under degree constraintsDiscrete Mathematics, 2018
- Decomposing C4‐free graphs under degree constraintsJournal of Graph Theory, 2018
- Internal Partitions of Regular GraphsJournal of Graph Theory, 2015
- Satisfactory graph partition, variants, and generalizationsEuropean Journal of Operational Research, 2010
- Graph Theory2008
- On stable cutsets in line graphsTheoretical Computer Science, 2003
- ContagionReview of Economic Studies, 2000
- Decomposing graphs under degree constraintsJournal of Graph Theory, 1996
- Recognizing decomposable graphsJournal of Graph Theory, 1984