Equitable partitions into matchings and coverings in mixed graphs

DOI10.1016/j.disc.2021.112651zbMath1477.05145arXiv1811.07856OpenAlexW3201939257MaRDI QIDQ2237227

Tamás Király, Yu Yokoi

Publication date: 27 October 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.07856

zbMATH Keywords

matchingpartitioning problemedge covermixed graph

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient scaling algorithm for the minimum weight bibranching problem
• Equitable partitions to spanning trees in a graph
• Directed star decompositions of directed multigraphs
• An efficient algorithm for minimum-weight bibranching
• Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations
• Path colorings in bipartite graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A Vizing-type theorem for matching forests
• Shortest bibranchings and valuated matroid intersection
• Notes on equitable partitions into matching forests in mixed graphs and \(b\)-branchings in digraphs
• Optimum matching forests I: Special weights
• Optimum matching forests II: General weights
• Optimum matching forests III: Facets of matching forest polyhedra
• Min-max Relations for Directed Graphs
• Equitable Coloring
• Optimal Matching Forests and Valuated Delta-Matroids
• Total dual integrality of matching forest constraints

This page was built for publication: Equitable partitions into matchings and coverings in mixed graphs