- 13 June 2026
- book chapter
- Published by Springer Nature
- p. 331-345
Abstract
No abstract availableKeywords
All Related Versions
This publication has 25 references indexed in Scilit:
- Hypergraph k-cut in randomized polynomial timeMathematical Programming, 2019
- The label cut problem with respect to path length and label frequencyTheoretical Computer Science, 2016
- The parameterized complexity of some minimum label problemsJournal of Computer and System Sciences, 2010
- Disjoint bases in a polymatroidRandom Structures & Algorithms, 2009
- Approximation and hardness results for label cut and related problemsJournal of Combinatorial Optimization, 2009
- On the orientation of graphs and hypergraphsDiscrete Applied Mathematics, 2003
- On decomposing a hypergraph into k connected sub-hypergraphsDiscrete Applied Mathematics, 2003
- Flows and generalized coloring theorems in graphsJournal of Combinatorial Theory, Series B, 1979
- On the Problem of Decomposing a Graph into n Connected FactorsJournal of the London Mathematical Society, 1961
- Edge-Disjoint Spanning Trees of Finite GraphsJournal of the London Mathematical Society, 1961