Packings of graphs and applications to computational complexity

Cites work

Complete subgraphs are elusive
Edge disjoint placement of graphs
scientific article; zbMATH DE number 3557238 (Why is no real title available?)
scientific article; zbMATH DE number 3617539 (Why is no real title available?)
scientific article; zbMATH DE number 3344609 (Why is no real title available?)
On the maximal number of independent circuits in a graph
On the Structure of Edge Graphs
On the structure of linear graphs

Cited in

(71)

Ore-type conditions implying 2-factors consisting of short cycles
Two theorems on packings of graphs
Packing trees in complete graphs
Symmetric edge-decompositions of hypercubes
Some results on the complexity of families of sets
On packing bipartite graphs
Embedding (p,p - 1) graphs in their complements
Packing of partial designs
Embedding digraphs of small size
Packing graphs in their complements
Packing two graphs of even girth 10
Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree
Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
Sparse graphs of girth at least five are packable
Packing of graphs - a survey
A near packing of two graphs
Graphs containing every 2-factor
Near packings of graphs
On embedding graphs with bounded sum of size and maximum degree
Labeled packing of cycles and circuits
A note on packing of uniform hypergraphs
Packing a number of copies of a \(( p , q )\)-graph
On the relation of separability, bandwidth and embedding
An Ore-type analogue of the Sauer-Spencer theorem
Labeled embedding of \((n, n-2)\)-graphs in their complements
Packing \(d\)-degenerate graphs
Labeled 2-packings of trees
On a packing problem of Alon and Yuster
The threshold bias of the clique-factor game
An approximate version of the tree packing conjecture
A list version of graph packing
A hypergraph version of a graph packing theorem by Bollobás and Eldridge
On degree sequences forcing the square of a Hamilton cycle
Embedding graphs having Ore-degree at most five
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
Extremal theorems for degree sequence packing and the two-color discrete tomography problem
Efficient graph packing via game colouring
Almost regular edge colorings and regular decompositions of complete graphs
Packing two copies of a sparse graph into a graph with restrained maximum degree
Embedding graphs in their complements
The Erdős-Sós conjecture for spiders of large size
A note on k-placeable graphs
Using Brouwer’s Fixed Point Theorem
Proof of a Packing Conjecture of Bollobás
Packing graphs of bounded codegree
A discrepancy version of the Hajnal-Szemerédi theorem
Near packings of two graphs
On the Bollobás–Eldridge Conjecture for Bipartite Graphs
On the elusiveness of Hamiltonian property
k-Planar Placement and Packing of Δ-Regular Caterpillars
Placing two edge-disjoint copies of a tree into a bipartite graph
Three edge-disjoint plane spanning paths in a point set
Labeled packing of non star trees into their \(k\) th power, \(k\geq 5\)
On the diameters of friends-and-strangers graphs
A robust Corrádi-Hajnal theorem
Packing directed cycles of specified odd length into digraphs and alternating cycles into bipartite graphs
On uniqueness of packing of three copies of 2-factors
Packing two trees into a graph with restrained maximum degree
Three edge-disjoint plane spanning paths in a point set
Packing of the k-power of Hamilton cycles
A generalization of the graph packing theorems of Sauer-Spencer and Brandt
Near packings with restriction on degrees in graphs
Clique factors in pseudorandom graphs
Combinatorics. Abstracts from the workshop held January 4--9, 2026
The Turán number of sparse spanning graphs
A note on packing two copies of a tree into a graph with small maximum degree
Packing two graphs of order n having total size at most 2n-2
Packing of two digraphs into a transitive tournament
Fixed-point-free embeddings of digraphs with small size
Packing of graphs with small product of sizes
On a graph packing conjecture by Bollobás, Eldridge and Catlin

This page was built for publication: Packings of graphs and applications to computational complexity

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