✦ LIBER ✦

On enumerating paths of K arcs in unoriented complete graphs

✍ Scribed by Eugene Rawdin; S.D. Bedrosian

Publisher: Elsevier Science
Year: 1975
Tongue: English
Weight: 248 KB
Volume: 299
Category: Article
ISSN: 0016-0032
DOI: 10.1016/0016-0032(75)90086-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Subdivisions of large complete bipartite

Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs

✍ Thomas Böhme; Bojan Mohar; Riste Škrekovski; Michael Stiebitz 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 67 KB 👁 1 views

## Abstract It is proved that for every positive integers __k__, __r__ and __s__ there exists an integer __n__ = __n__(__k__,__r__,__s__) such that every __k__‐connected graph of order at least __n__ contains either an induced path of length __s__ or a subdivision of the complete bipartite graph __

Note on the order of magnitude of k for

Note on the order of magnitude of k for complete k-arcs in PG(2,q)

✍ Tamás Szőnyi 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 220 KB

On weights of induced paths and cycles i

On weights of induced paths and cycles in claw-free and K1,r-free graphs

✍ J. Harant; M. Voigt; S. Jendrol; B. Randerath; Z. Ryjáček; I. Schiermeyer 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 175 KB 👁 3 views

On the number of edge-disjoint one facto

On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs

✍ D.G. Hoffman; C.A. Rodger 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 503 KB

In this paper we use Tutte's f-factor theorem and the method of amalgamations to find necessary and sufficient conditions for the existence of a k-factor in the complete multipartite graph K(p(1 ) ..... p(n)), conditions that are reminiscent of the Erd6s-Gallai conditions for the existence of simple