𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Diameter and Treewidth in Minor-Closed Graph Families

✍ Scribed by D. Eppstein

Book ID
118297467
Publisher
Springer
Year
2000
Tongue
English
Weight
130 KB
Volume
27
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Strengthening ErdΓΆs–PΓ³sa property for mi
Strengthening ErdΓΆs–PΓ³sa property for minor-closed graph classes
✍ Fedor V. Fomin; Saket Saurabh; Dimitrios M. Thilikos πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 86 KB

Let H and G be graph classes. We say that H has the Erd" os-Pósa property for G if for any graph G ∈ G, the minimum vertex covering of all H-subgraphs of G is bounded by a function f of the maximum packing of H-subgraphs in G (by H-subgraph of G we mean any subgraph of G that belongs to H). Robertso

A family of graphs and the degree/diamet
A family of graphs and the degree/diameter problem
✍ Geoffrey Exoo πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 64 KB πŸ‘ 1 views

## Abstract We investigate a family of graphs relevant to the problem of finding large regular graphs with specified degree and diameter. Our family contains the largest known graphs for degree/diameter pairs (3, 7), (3, 8), (4, 4), (5, 3), (5, 5), (6, 3), (6, 4), (7, 3), (14, 3), and (16, 2). We a

Connectivity and diameter in distance gr
Connectivity and diameter in distance graphs
✍ Lucia Draque Penso; Dieter Rautenbach; Jayme Luiz Szwarcfiter πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 111 KB