Subgraphs of graphs. I
From MaRDI portal
Publication:1846887
DOI10.1016/0012-365X(74)90119-8zbMath0289.05122WikidataQ60060511 ScholiaQ60060511MaRDI QIDQ1846887
Publication date: 1974
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
An approximate version of the tree packing conjecture, A list version of graph packing, Two theorems on packings of graphs, Packing bipartite graphs, Isoperimetric numbers of graphs, An Ore-type analogue of the Sauer-Spencer theorem, Graph factors and factorization: 1985--2003: a survey, Graphs containing every 2-factor, Nonexistence of universal graphs without some trees, Packing two graphs of even girth 10, On the combinatorial problems which I would most like to see solved, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, An \(\Omega{} (n^{4/3})\) lower bound on the randomized complexity of graph properties, Efficient Graph Packing via Game Colouring, On packing bipartite graphs, Embedding graphs in their complements, On a graph packing conjecture by Bollobás, Eldridge and Catlin, Packing Graphs of Bounded Codegree, The Turán number of sparse spanning graphs, Subgraphs with triangular components, Packing of graphs - a survey, Packing two copies of a sparse graph into a graph with restrained maximum degree, Ore-type conditions implying 2-factors consisting of short cycles, A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge, A near packing of two graphs, Typical and extremal aspects of friends-and-strangers graphs, Some results on placing bipartite graphs of maximum degree two, Connectivity of friends-and-strangers graphs on random pairs, Packing of partial designs, On the bipartite graph packing problem
Cites Work
