Excessive factorizations of bipartite multigraphs

DOI10.1016/J.DAM.2010.07.004zbMath1208.05106OpenAlexW2067686288WikidataQ114191536 ScholiaQ114191536MaRDI QIDQ602754

David Cariolaro, Romeo Rizzi

Publication date: 5 November 2010

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

Full work available at URL: https://doi.org/10.1016/j.dam.2010.07.004

zbMATH Keywords

network flowvertex covermatching theorybipartite multigraphexcessive factorization

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

Excessive factorizations of bipartite multigraphs ⋮ On the excessive \([m\)-index of a tree] ⋮ On the Complexity of Computing the Excessive [B-Index of a Graph] ⋮ Excessive \([l, m\)-factorizations]

Cites Work

• Unnamed Item
• Unnamed Item
• Excessive factorizations of bipartite multigraphs
• Covering graphs with matchings of fixed size
• Excessive near 1-factorizations
• Matching theory
• The excessive [3-index of all graphs]
• On minimum sets of 1-factors covering a complete multipartite graph
• The NP-Completeness of Edge-Coloring
• Paths, Trees, and Flowers
• The Solution of a Timetabling Problem

This page was built for publication: Excessive factorizations of bipartite multigraphs