Random packing by \(\rho\)-connected \(\rho\)-regular graphs

DOI10.1016/0012-365X(95)00147-OzbMath0954.05038MaRDI QIDQ1126281

Lowell W. Beineke, William D. Weakley, Peter Hamburger

Publication date: 5 February 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

characterizationpackingforbidden graphpackable graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cites Work

• Unnamed Item
• Unnamed Item
• Randomly decomposable graphs
• Random packings of graphs
• Über den Zusammenhang symmetrischer Graphen
• A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs
• Connectivity of transitive graphs

This page was built for publication: Random packing by \(\rho\)-connected \(\rho\)-regular graphs