Subgraphs of graphs. I
From MaRDI portal
Recommendations
Cites work
Cited in
(35)- Packing graphs of bounded codegree
- Typical and extremal aspects of friends-and-strangers graphs
- Graphs containing every 2-factor
- An Ore-type analogue of the Sauer-Spencer theorem
- Nonexistence of universal graphs without some trees
- Betti numbers of subgraphs
- Connectivity of friends-and-strangers graphs on random pairs
- An approximate version of the tree packing conjecture
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- A near packing of two graphs
- A list version of graph packing
- On the combinatorial problems which I would most like to see solved
- Forbidden graphs for degree and neighbourhood conditions
- A hypergraph version of a graph packing theorem by Bollobás and Eldridge
- Packing of partial designs
- Packing two copies of a sparse graph into a graph with restrained maximum degree
- The Turán number of sparse spanning graphs
- On packing bipartite graphs
- On the bipartite graph packing problem
- On a graph packing conjecture by Bollobás, Eldridge and Catlin
- Subgraphs with triangular components
- Spanning subgraphs with specified valencies. (Reprint)
- Packing of graphs - a survey
- Isoperimetric numbers of graphs
- An \(\Omega{} (n^{4/3})\) lower bound on the randomized complexity of graph properties
- Ore-type conditions implying 2-factors consisting of short cycles
- Embedding graphs in their complements
- Packing two graphs of even girth 10
- Graph factors and factorization: 1985--2003: a survey
- scientific article; zbMATH DE number 6770116 (Why is no real title available?)
- Packing bipartite graphs
- Efficient graph packing via game colouring
- scientific article; zbMATH DE number 540115 (Why is no real title available?)
- Some results on placing bipartite graphs of maximum degree two
- Two theorems on packings of graphs
This page was built for publication: Subgraphs of graphs. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1846887)