Oriented star packings
From MaRDI portal
Publication:2483479
Recommendations
Cites work
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A short proof of K�nig's matching theorem
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Efficient subgraphs packing
- Graph packings
- K�nig's edge coloring theorem without augmenting paths
- Matching theory
- On generalized matching problems
- On the complexity of digraph packings
- Packing paths in digraphs
- Packing subgraphs in a graph
- Packings by Complete Bipartite Graphs
- Packings by cliques and by finite families of graphs
- Paths, Trees, and Flowers
Cited in
(8)- Equistarable bipartite graphs
- Packing paths in digraphs
- On star family packing of graphs
- Exact formulas for fixation probabilities on a complete oriented star
- Treewidth versus clique number. I: Graph classes with a forbidden structure
- The superstar packing problem
- scientific article; zbMATH DE number 4180219 (Why is no real title available?)
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem
This page was built for publication: Oriented star packings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483479)