On a graph packing conjecture by Bollobás, Eldridge and Catlin
type: Item
instance of: scholarly article
title: On a graph packing conjecture by Bollobás, Eldridge and Catlin
zbMATH Open document ID: 1212.05132
author: Hemanshu Kaul
author: Gexin Yu
author: Alexandr Kostochka
published in: Combinatorica
publication date: 2010-08-13T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5770341
zbMATH Keywords: graph packing
Wikidata QID: Q123133273
MaRDI profile type: Publication
full work available at URL: s00493-008-2278-0
OpenAlex ID: W2006001677
cites work: Embedding Arbitrary Graphs of Maximum Degree Two
cites work: 2-factors in dense graphs
cites work: Packings of graphs and applications to computational complexity
cites work: Packing \(d\)-degenerate graphs
cites work: Subgraphs of graphs. I
cites work: Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three
cites work: A near packing of two graphs
cites work: Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer
cites work: Edge disjoint placement of graphs
cites work: Packing of graphs - a survey
DOI: 10.1007/S00493-008-2278-0
description: scientific article; zbMATH DE number 5770341