On generalized matching problems
From MaRDI portal
Cites work
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
- F-factors of graphs: A generalized matching problem
- scientific article; zbMATH DE number 3141016 (Why is no real title available?)
- scientific article; zbMATH DE number 3716811 (Why is no real title available?)
- scientific article; zbMATH DE number 3743308 (Why is no real title available?)
- scientific article; zbMATH DE number 3409134 (Why is no real title available?)
- On certain classes of fractional matchings
- On the completeness of a generalized matching problem
- On the Computational Complexity of Combinatorial Problems
- Paths, Trees, and Flowers
- The Factorization of Linear Graphs
- TWO THEOREMS IN GRAPH THEORY
Cited in
(16)- On the complexity of digraph packings
- Packings by cliques and by finite families of graphs
- A parameter linked with \(G\)-factors and the binding number
- On the tree packing problem
- Generalized partitions of graphs
- Maximum tree-packing in time \(O(n^{5/2})\)
- Maximum packing for biconnected outerplanar graphs
- Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time
- On caterpillar factors in graphs
- Oriented star packings
- Packings by Complete Bipartite Graphs
- The complexity of generalized domino tilings
- Maximum tree-packing in time O(n5/2)
- Generalized graph packing problems parameterized by treewidth
- Chain packing in graphs
- Graph factors and factorization: 1985--2003: a survey
This page was built for publication: On generalized matching problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1149783)
