Packings in Dense Regular Graphs
From MaRDI portal
Recommendations
Cited in
(20)- Triangle packings and 1-factors in oriented graphs
- Relaxations of vertex packing
- Random packing by -connected -regular graphs
- Regular packings of regular graphs
- On vertex-disjoint paths in regular graphs
- Packing of graphs - a survey
- Near packings of graphs
- Partitioning the vertices of a torus into isomorphic subgraphs
- Perfect packings with complete graphs minus an edge
- The complexity of perfect packings in dense graphs
- A hypergraph blow-up lemma
- scientific article; zbMATH DE number 4049679 (Why is no real title available?)
- scientific article; zbMATH DE number 1229732 (Why is no real title available?)
- scientific article; zbMATH DE number 1022391 (Why is no real title available?)
- Hamilton cycles in dense vertex-transitive graphs
- An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs
- A bandwidth theorem for approximate decompositions
- Nearly Hamilton cycles in sublinear expanders and applications
- Packing subdivisions into regular graphs
- Integer and fractional packings in dense graphs
This page was built for publication: Packings in Dense Regular Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680571)