Packing two graphs of even girth 10
From MaRDI portal
Publication:1689911
DOI10.1016/j.endm.2017.06.038zbMath1378.05160OpenAlexW2744915555MaRDI QIDQ1689911
Wouter Cames van Batenburg, Ross J. Kang
Publication date: 18 January 2018
Full work available at URL: http://hdl.handle.net/2066/176419
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Density (toughness, etc.) (05C42)
Related Items
Cites Work
- Unnamed Item
- Edge disjoint placement of graphs
- On a graph packing conjecture by Bollobás, Eldridge and Catlin
- Packings of graphs and applications to computational complexity
- Packing two graphs of even girth 10
- Subgraphs of graphs. I
- A near packing of two graphs
- Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three
- Packing \(d\)-degenerate graphs
- Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer
- Embedding Arbitrary Graphs of Maximum Degree Two
- The History of Degenerate (Bipartite) Extremal Graph Problems
- On the Bollobás–Eldridge Conjecture for Bipartite Graphs
- On Two Conjectures on Packing of Graphs
- Graph colouring and the probabilistic method