Packings of graphs and applications to computational complexity

Cites work

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?)
Complete subgraphs are elusive
Edge disjoint placement of graphs
On the Structure of Edge Graphs
On the maximal number of independent circuits in a graph
On the structure of linear graphs

Cited in

(64)

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

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)