On minimum sets of 1-factors covering a complete multipartite graph

DOI10.1002/jgt.20303zbMath1158.05049OpenAlexW4230518595MaRDI QIDQ3522849

David Cariolaro, Hung-Lin Fu

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

zbMATH Keywords

1-factorcomplete multipartite graphexcessive indexexcessive factorization1-factor cover

Mathematics Subject Classification ID

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

• The chromatic index of complete multipartite graphs
• The Solution of a Timetabling Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On minimum sets of 1-factors covering a complete multipartite graph