Oriented star packings
From MaRDI portal
Publication:2483479
DOI10.1016/J.JCTB.2007.09.004zbMATH Open1139.05027OpenAlexW1992684615MaRDI QIDQ2483479FDOQ2483479
Authors: 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
Recommendations
Directed graphs (digraphs), tournaments (05C20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Matching theory
- Paths, Trees, and Flowers
- Title not available (Why is that?)
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Graph packings
- Packings by cliques and by finite families of graphs
- Packing subgraphs in a graph
- On generalized matching problems
- Efficient subgraphs packing
- Packings by Complete Bipartite Graphs
- Packing paths in digraphs
- On the complexity of digraph packings
- A short proof of K�nig's matching theorem
- K�nig's edge coloring theorem without augmenting paths
Cited In (8)
- On star family packing of graphs
- Equistarable bipartite graphs
- Title not available (Why is that?)
- Packing paths in digraphs
- The superstar packing problem
- Treewidth versus clique number. I: Graph classes with a forbidden structure
- 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
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)
