Regular packings of regular graphs

DOI10.1016/S0012-365X(01)00065-6zbMATH Open0992.05061OpenAlexW2071668869MaRDI QIDQ1349079

O. Diekmann

Publication date: 21 May 2002

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00065-6

zbMATH Keywords

packingsextremal graphsregular graphs\(G\)-decomposable graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

More on decompositions of edge-colored complete graphs

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Packing graphs in their complements 👍 👎
• Packings in complete graphs 👍 👎
• Graph packings 👍 👎
• On the packing numbers in graphs 👍 👎
• Packings in Dense Regular Graphs 👍 👎
• Packing in regular graphs 👍 👎
• Packing vertices and edges in random regular graphs 👍 👎

This page was built for publication: Regular packings of regular graphs

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