Edge disjoint placement of graphs
From MaRDI portal
Publication:754889
DOI10.1016/0095-8956(78)90005-9zbMATH Open0417.05037OpenAlexW2082497622WikidataQ106026630 ScholiaQ106026630MaRDI QIDQ754889FDOQ754889
Authors: Norbert Sauer, Joel Spencer 
Publication date: 1978
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(78)90005-9
Cites Work
Cited In (95)
- Mutual placement of bipartite graphs
- Packing of graphs with small product of sizes
- An Ore-type analogue of the Sauer-Spencer theorem
- Packing of graphs and permutations -- a survey
- Graphs containing every 2-factor
- Spanning cubic graph designs
- Nonexistence of universal graphs without some trees
- Partition of a bipartite graph into cycles
- A note on \(k\)-placeable graphs
- On the Bollobás–Eldridge Conjecture for Bipartite Graphs
- Proof of a Packing Conjecture of Bollobás
- A sufficient degree condition for a graph to contain all trees of size \(k\)
- A near packing of two graphs
- Embedding (p,p - 1) graphs in their complements
- Title not available (Why is that?)
- A list version of graph packing
- The Erdős-Sós conjecture for spiders of large size
- Triangle packings and 1-factors in oriented graphs
- A hypergraph version of a graph packing theorem by Bollobás and Eldridge
- Packing of partial designs
- Orthogonal double covers of general graphs.
- Symmetric edge-decompositions of hypercubes
- Packings of graphs and applications to computational complexity
- Packing \(d\)-degenerate graphs
- On graphs with linear Ramsey numbers
- Packing two copies of a sparse graph into a graph with restrained maximum degree
- Packing of two digraphs into a transitive tournament
- Cycle factors in dense graphs
- The Turán number of sparse spanning graphs
- On packing bipartite graphs
- Optimal factorizations of families of trees
- 2-factors in dense graphs
- Fixed-point-free embeddings of digraphs with small size
- Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem
- On a graph packing conjecture by Bollobás, Eldridge and Catlin
- Embedding graphs of small size
- Embedding digraphs of small size
- Packing graphs in their complements
- On the elusiveness of Hamiltonian property
- A note on packing of uniform hypergraphs
- Subgraphs with triangular components
- Augmentation of covering arrays of strength two
- Packing of graphs - a survey
- Isoperimetric numbers of graphs
- 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
- The Ramsey number of the clique and the hypercube
- Ore-type conditions implying 2-factors consisting of short cycles
- Embedding graphs in their complements
- A note on packing two copies of a tree into a graph with small maximum degree
- Labeled packing of cycles and circuits
- A note on packing of graphic \(n\)-tuples
- Hypergraph packing and sparse bipartite Ramsey numbers
- Efficient graph packing via game colouring
- A note on packing of three forests
- A note on the ``packing of two copies of some trees into their third power
- Near packings of graphs
- On self-complementary supergraphs of (\(n,n\))-graphs
- Near packings of two graphs
- Degree sequences of random graphs
- Disjoint directed cycles in directed graphs
- Packing two graphs of order n having total size at most 2n-2
- Triple placement of graphs
- Packing of graphic \(n\)-tuples
- Ramsey-goodness -- and otherwise
- Two theorems on packings of graphs
- Disjoint directed cycles with specified lengths in directed bipartite graphs
- Packing Trees into 1-planar Graphs
- Typical and extremal aspects of friends-and-strangers graphs
- Packing a number of copies of a \(( p , q )\)-graph
- Labeled packing of non star trees into their \(k\) th power, \(k\geq 5\)
- Partial degrees on matchings for cycles in bipartite graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Connectivity of friends-and-strangers graphs on random pairs
- On a packing problem of Alon and Yuster
- Labeled embedding of \((n, n-2)\)-graphs in their complements
- Labeled 2-packings of trees
- Packing three copies of a tree into its sixth power
- On embedding graphs with bounded sum of size and maximum degree
- Sparse graphs of girth at least five are packable
- Embedding Graphs Having Ore-Degree at Most Five
- The complexity of cover graph recognition for some varieties of finite lattices
- On the diameters of friends-and-strangers graphs
- On the bipartite graph packing problem
- Partial Degree Conditions and Cycle Coverings
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Flip colouring of graphs
- Packing Graphs of Bounded Codegree
- k-Planar Placement and Packing of Δ-Regular Caterpillars
- Embedding of graphs in two-irregular graphs
- Packing two graphs of even girth 10
- Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree
- On uniqueness of packing of three copies of 2-factors
- Toughness, degrees and 2-factors
- Packing three trees
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)
