𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Extremal connectivity for topological cliques in bipartite graphs

✍ Scribed by Daniela Kühn; Deryk Osthus

Book ID
108167390
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
324 KB
Volume
96
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extremal graphs for intersecting cliques
Extremal graphs for intersecting cliques
✍ Guantao Chen; Ronald J. Gould; Florian Pfender; Bing Wei 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 156 KB
Extremal graphs in connectivity augmenta
Extremal graphs in connectivity augmentation
✍ Jord�n, Tibor 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB 👁 1 views

Let A(n, k, t) denote the smallest integer e for which every kconnected graph on n vertices can be made (k + t)-connected by adding e new edges. We determine A(n, k, t) for all values of n, k, and t in the case of (directed and undirected) edge-connectivity and also for directed vertex-connectivity

Topological minors in bipartite graphs
Topological minors in bipartite graphs
✍ Camino Balbuena; Martín Cera; Pedro García-Vázquez; Juan Carlos Valenzuela 📂 Article 📅 2011 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 263 KB
An extremal bandwidth problem for bipart
An extremal bandwidth problem for bipartite graphs
✍ Robert C. Brigham; Julie R. Carrington; Ronald D. Dutton; Joseph Fiedler; Richar 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 119 KB 👁 2 views