Excessive factorizations of bipartite multigraphs

DOI10.1016/J.DAM.2010.07.004MaRDI QIDQ602754zbMATH OpenOpenAlexWikidataFDO

Authors D. 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

bipartite multigraphexcessive factorizationmatching theorynetwork flowvertex cover

Mathematics Subject Classification ID

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

Recommendations

• Excessive \([l, m]\)-factorizations
• On the complexity of computing the excessive \([B]\)-index of a graph
• scientific article; zbMATH DE number 5130724
• Covering graphs with matchings of fixed size
• The excessive [3]-index of all graphs

Cites work

• Covering graphs with matchings of fixed size
• Excessive factorizations of bipartite multigraphs
• Excessive near 1-factorizations
• scientific article; zbMATH DE number 5130724 (Why is no real title available?)
• scientific article; zbMATH DE number 3378938 (Why is no real title available?)
• Matching theory
• On minimum sets of 1-factors covering a complete multipartite graph
• Paths, Trees, and Flowers
• The excessive [3]-index of all graphs
• The NP-Completeness of Edge-Coloring
• The Solution of a Timetabling Problem

Cited in

(6)

• Excessive \([l, m]\)-factorizations
• The spectrum of path factorization of bipartite multigraphs
• On the complexity of computing the excessive \([B]\)-index of a graph
• scientific article; zbMATH DE number 5130724 (Why is no real title available?)
• Excessive factorizations of bipartite multigraphs
• On the excessive \([m]\)-index of a tree

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q602754)