Graphs that are randomly packable by some common disconnected graphs

zbMATH Open0918.05081MaRDI QIDQ1286572FDOQ1286572

Authors: K. Appert 

Publication date: 3 May 1999

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1300357
• scientific article; zbMATH DE number 5665909
• Random packings of graphs
• Random packing by \(\rho\)-connected \(\rho\)-regular graphs
• Packing random graphs and hypergraphs
• Edge-disjoint packings of graphs
• Packing vertices and edges in random regular graphs
• scientific article; zbMATH DE number 1929931
• Random near-regular graphs and the node packing problem
• Random graphs with few disjoint cycles

zbMATH Keywords

randomly \(F\)-packable

Mathematics Subject Classification ID

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

Cited In (3)

• Title not available (Why is that?)
• Randomly \(P_k\)-decomposable graphs
• Random packing by \(\rho\)-connected \(\rho\)-regular graphs

This page was built for publication: Graphs that are randomly packable by some common disconnected graphs

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