On minimum sets of 1-factors covering a complete multipartite graph
From MaRDI portal
Publication:3522849
DOI10.1002/jgt.20303zbMath1158.05049OpenAlexW4230518595MaRDI QIDQ3522849
Publication date: 4 September 2008
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20303
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (8)
Excessive factorizations of bipartite multigraphs ⋮ On excessive index of certain networks ⋮ Excessive index for mesh derived networks ⋮ Covering graphs with matchings of fixed size ⋮ Berge-Fulkerson conjecture on certain snarks ⋮ On the Complexity of Computing the Excessive [B-Index of a Graph] ⋮ Excessive near 1-factorizations ⋮ Excessive \([l, m\)-factorizations]
Cites Work
This page was built for publication: On minimum sets of 1-factors covering a complete multipartite graph