Low weight perfect matchings
From MaRDI portal
Publication:2223441
DOI10.37236/9994zbMath1456.05070arXiv2010.15418OpenAlexW3113933922MaRDI QIDQ2223441
Elena Mohr, Dieter Rautenbach, Stefan Ehard
Publication date: 29 January 2021
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.15418
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Signed and weighted graphs (05C22)
Related Items
On the existence of zero-sum perfect matchings of complete graphs, Zero-sum copies of spanning forests in zero-sum complete graphs, Almost color-balanced perfect matchings in color-balanced complete graphs, Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation, Unbalanced spanning subgraphs in edge labeled complete graphs, The balancing number and generalized balancing number of some graph classes, On zero-sum spanning trees and zero-sum connectivity
Cites Work