Randomly decomposable graphs
From MaRDI portal
Publication:1073048
DOI10.1016/0012-365X(85)90161-XzbMath0588.05035MaRDI QIDQ1073048
Publication date: 1985
Published in: Discrete Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)
Related Items (12)
All \(M_{2}\)-equicoverable graphs ⋮ A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs ⋮ Random packing by matroid bases and triangles ⋮ Randomly planar graphs ⋮ Random packing by \(\rho\)-connected \(\rho\)-regular graphs ⋮ P4-equicoverable graphs which contain cycles with length at least 4 ⋮ A short update on equipackable graphs ⋮ \(P_{3}\)-equicoverable graphs-research on \(H\)-equicoverable graphs ⋮ All \(P_{3}\)-equipackable graphs ⋮ Randomly \(P_k\)-decomposable graphs ⋮ \(M_{2}\)-equipackable graphs ⋮ Random packings of graphs
Cites Work
This page was built for publication: Randomly decomposable graphs
