Random packing by -connected -regular graphs

DOI10.1016/0012-365X(95)00147-OzbMATH Open0954.05038MaRDI QIDQ1126281FDOQ1126281

L. 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

• Random packings of graphs
• Title not available (Why is that?)
• Über den Zusammenhang symmetrischer Graphen
• Connectivity of transitive graphs
• A forbidden subgraphs characterization and a polynomial algorithm for randomly decomposable graphs
• Randomly decomposable graphs
• Title not available (Why is that?)

Cited In (2)

• Title not available (Why is that?)
• Graphs that are randomly packable by some common disconnected graphs

   Recommendations

• Random packings of graphs 👍 👎
• Random near-regular graphs and the node packing problem 👍 👎
• Packing vertices and edges in random regular graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Packing random graphs and hypergraphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Packings in Dense Regular Graphs 👍 👎
• Graphs that are randomly packable by some common disconnected graphs 👍 👎
• Packing Arborescences in Random Digraphs 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1126281)