Oriented star packings
From MaRDI portal
Publication:2483479
DOI10.1016/j.jctb.2007.09.004zbMath1139.05027OpenAlexW1992684615MaRDI QIDQ2483479
Romeo Rizzi, Richard C. Brewster, Pavol Hell
Publication date: 28 April 2008
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2007.09.004
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)
Related Items (4)
Equistarable bipartite graphs ⋮ Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem ⋮ Exact formulas for fixation probabilities on a complete oriented star ⋮ Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of digraph packings
- Packings by cliques and by finite families of graphs
- Matching theory
- On generalized matching problems
- Packing subgraphs in a graph
- Efficient subgraphs packing
- Packings by Complete Bipartite Graphs
- [https://portal.mardi4nfdi.de/wiki/Publication:4242913 K�nig's edge coloring theorem without augmenting paths]
- Packing paths in digraphs
- [https://portal.mardi4nfdi.de/wiki/Publication:4948507 A short proof of K�nig's matching theorem]
- Paths, Trees, and Flowers
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
This page was built for publication: Oriented star packings
