Randomly P_k-decomposable graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4134097 (Why is no real title available?)
- scientific article; zbMATH DE number 1300357 (Why is no real title available?)
- scientific article; zbMATH DE number 1933236 (Why is no real title available?)
- scientific article; zbMATH DE number 1743980 (Why is no real title available?)
- A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs
- All \(P_{3}\)-equipackable graphs
- Graphs that are randomly packable by some common disconnected graphs
- Random packings of graphs
- Randomly decomposable graphs
Cited in
(6)- scientific article; zbMATH DE number 4134097 (Why is no real title available?)
- scientific article; zbMATH DE number 1933236 (Why is no real title available?)
- scientific article; zbMATH DE number 1743980 (Why is no real title available?)
- Randomly \(P_3\)-decomposable multigraphs
- scientific article; zbMATH DE number 5287650 (Why is no real title available?)
- Decomposing almost complete graphs by random trees
This page was built for publication: Randomly \(P_k\)-decomposable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q713169)