Edge disjoint placement of graphs
From MaRDI portal
Publication:754889
Cited in
(only showing first 100 items - show all)- Triangle packings and 1-factors in oriented graphs
- Ore-type conditions implying 2-factors consisting of short cycles
- Spanning cubic graph designs
- Two theorems on packings of graphs
- Degree sequences of random graphs
- Symmetric edge-decompositions of hypercubes
- An \(\Omega{} (n^{5/4})\) lower bound on the randomized complexity of graph properties
- An \(\Omega{} (n^{4/3})\) lower bound on the randomized complexity of graph properties
- On packing bipartite graphs
- Embedding (p,p - 1) graphs in their complements
- Packings of graphs and applications to computational complexity
- Cycle factors in dense graphs
- Optimal factorizations of families of trees
- Mutual placement of bipartite graphs
- Packing of partial designs
- Embedding graphs of small size
- A note on packing of three forests
- Embedding digraphs of small size
- Nonexistence of universal graphs without some trees
- Packing of graphs and permutations -- a survey
- Orthogonal double covers of general graphs.
- A note on the ``packing of two copies of some trees into their third power
- 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
- On self-complementary supergraphs of (n,n)-graphs
- Packing of graphs - a survey
- A near packing of two graphs
- Toughness, degrees and 2-factors
- The complexity of cover graph recognition for some varieties of finite lattices
- Packing three trees
- 2-factors in dense graphs
- Graphs containing every 2-factor
- Near packings of graphs
- On embedding graphs with bounded sum of size and maximum degree
- Typical and extremal aspects of friends-and-strangers graphs
- Connectivity of friends-and-strangers graphs on random pairs
- Labeled packing of cycles and circuits
- A note on packing of uniform hypergraphs
- Disjoint directed cycles in directed graphs
- Packing a number of copies of a \(( p , q )\)-graph
- Packing three copies of a tree into its sixth power
- Ramsey-goodness -- and otherwise
- On the bipartite graph packing problem
- Triple placement of graphs
- 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
- Isoperimetric numbers of graphs
- Disjoint directed cycles with specified lengths in directed bipartite graphs
- Embedding of graphs in two-irregular graphs
- A list version of graph packing
- A hypergraph version of a graph packing theorem by Bollobás and Eldridge
- Packing of graphic n-tuples
- 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
- Hypergraph packing and sparse bipartite Ramsey numbers
- 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
- On graphs with linear Ramsey numbers
- scientific article; zbMATH DE number 7021376 (Why is no real title available?)
- Proof of a Packing Conjecture of Bollobás
- Packing graphs of bounded codegree
- Partial Degree Conditions and Cycle Coverings
- A note on packing of graphic \(n\)-tuples
- Packing trees into 1-planar graphs
- Near packings of two graphs
- On the Bollobás–Eldridge Conjecture for Bipartite Graphs
- A sufficient degree condition for a graph to contain all trees of size k
- The Ramsey number of the clique and the hypercube
- On the elusiveness of Hamiltonian property
- k-Planar Placement and Packing of Δ-Regular Caterpillars
- Labeled packing of non star trees into their \(k\) th power, \(k\geq 5\)
- Partial degrees on matchings for cycles in bipartite graphs
- On the diameters of friends-and-strangers graphs
- Flip colouring of graphs
- On uniqueness of packing of three copies of 2-factors
- Partition of a bipartite graph into cycles
- Packing two trees into a graph with restrained maximum degree
- Packing of the k-power of Hamilton cycles
- Rainbow stackings of random edge-colorings
- A generalization of the graph packing theorems of Sauer-Spencer and Brandt
- Near packings with restriction on degrees in graphs
- Packing two copies of a tree into a bipartite graph with restrained maximum degree
- The Turán number of sparse spanning graphs
- Subgraphs with triangular components
- 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
- Augmentation of covering arrays of strength two
- Packing of graphs with small product of sizes
This page was built for publication: Edge disjoint placement of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q754889)
