Randomly \(P_k\)-decomposable graphs
From MaRDI portal
Publication:713169
DOI10.1016/J.DISC.2012.07.036zbMath1251.05142OpenAlexW2239506205MaRDI QIDQ713169
Myles McNally, Robert R. Molina
Publication date: 26 October 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.07.036
Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- All \(P_{3}\)-equipackable graphs
- Randomly decomposable graphs
- Graphs that are randomly packable by some common disconnected graphs
- Random packings of graphs
- A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Randomly \(P_k\)-decomposable graphs