✦ LIBER ✦

An extremal problem for cycles in hamiltonian graphs

✍ Scribed by George R. T. Hendry; Stephan Brandt

Publisher: Springer Japan
Year: 1995
Tongue: English
Weight: 460 KB
Volume: 11
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01793012

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An extremal problem for 3-graphs

✍ P. Frankl 📂 Article 📅 1978 🏛 Akadmiai Kiad 🌐 English ⚖ 241 KB

Turán's extremal problem in random graph

Turán's extremal problem in random graphs: Forbidding odd cycles

✍ P. E. Haxell; Y. Kohayakawa; T. Luczak 📂 Article 📅 1996 🏛 Springer-Verlag 🌐 English ⚖ 786 KB

An extremal problem in geodetic graphs

✍ K.R. Parthasarathy; N. Srinivasan 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 365 KB

An extremal problem for paths in biparti

An extremal problem for paths in bipartite graphs

✍ A. Gyárfás; C. C. Rousseau; R. H. Schelp 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 621 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

An extremal problem for H-linked graphs

✍ Alexandr Kostochka; Gexin Yu 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB 👁 1 views

## Abstract We introduce the notion of __H__‐linked graphs, where __H__ is a fixed multigraph with vertices __w__~1~,…,__w__~m~. A graph __G__ is __H__‐__linked__ if for every choice of vertices υ~1~,…, υ~m~ in __G__, there exists a subdivision of __H__ in __G__ such that υ~i~ is the branch vertex