Covering graphs with matchings of fixed size
From MaRDI portal
\([m\)-covering]excessive \([m\)-factorization]excessive \([m\)-index]
Recommendations
Cites work
- scientific article; zbMATH DE number 5130724 (Why is no real title available?)
- scientific article; zbMATH DE number 3325507 (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 Solution of a Timetabling Problem
Cited in
(12)- A generalisation of matching and colouring
- Excessive \([l, m]\)-factorizations
- The excessive [3]-index of all graphs
- On the complexity of computing the excessive \([B]\)-index of a graph
- Covering cubic graphs with matchings of large size
- Maintaining a large matching and a small vertex cover
- scientific article; zbMATH DE number 5308553 (Why is no real title available?)
- On excessive index of certain networks
- Excessive index for mesh derived networks
- Some results of minimum sets of 1-factors covering a graph
- Excessive factorizations of bipartite multigraphs
- On the excessive \([m]\)-index of a tree
This page was built for publication: Covering graphs with matchings of fixed size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960925)