Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs
From MaRDI portal
Publication:6045402
DOI10.46298/dmtcs.8719MaRDI QIDQ6045402
Publication date: 30 May 2023
Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matchings and \(\Delta\)-matroids
- Some combinatorial properties of discriminants in metric vector spaces
- Pseudomatroids
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A Vizing-type theorem for matching forests
- Shortest bibranchings and valuated matroid intersection
- Relationship of two formulations for shortest bibranchings
- The \(b\)-branching problem in digraphs
- Equitable partitions into matchings and coverings in mixed graphs
- Some graphical properties of matrices with non-negative entries
- Integer Rounding for Polymatroid and Branching Optimization Problems
- Greedy algorithm and symmetric matroids
- Optimum matching forests I: Special weights
- Optimum matching forests II: General weights
- Optimum matching forests III: Facets of matching forest polyhedra
- Disjoint Common Transversals and Exchange Structures
- Integral decomposition in polyhedra
- Packing rooted directed cuts in a weighted directed graph
- Optimal Matching Forests and Valuated Delta-Matroids
- Optimum branchings
- Decomposition of bipartite multigraphs into matchings
- The Solution of a Timetabling Problem
- A Note on a Nearly Uniform Partition into Common Independent Sets of Two Matroids
- Total dual integrality of matching forest constraints
This page was built for publication: Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs
