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