๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On short paths through prescribed vertices of a graph

โœ Scribed by Erhard Hexel

Book ID
108113602
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
150 KB
Volume
307
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Long paths through four vertices in a 2-
Long paths through four vertices in a 2-connected graph
โœ Barovich, Mark V. ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 252 KB ๐Ÿ‘ 2 views

Let G be a 2-connected graph, let u and v be distinct vertices in V (G), and let X be a set of at most four vertices lying on a common (u

On cycles through prescribed vertices in
On cycles through prescribed vertices in weakly separable graphs
โœ A.K. Kelmans; M.V. Lomonosov ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 275 KB

Notions and notations 1.1. Given an undirected graph G let V(G), E(G), K(G) and comp(G) denote the vertex-set, edge-set, vertex connectivity and number of components of G, respectively. Put P(G)={(X, Y): X~V(G), Tc\\_E(G--X)}. For X~V(G) let G(X) denote the induced suL\\*graph. For Y :\\_ E(G) let G

Covering the vertices of a graph by cycl
Covering the vertices of a graph by cycles of prescribed length
โœ D. Amar; I. Fournier; A. Germa ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 321 KB

The main theorem of that paper is the following: let G be a graph of order n, of size at least (nZ -3n + 6 ) / 2 . For any integers k, n,, n2,. . . , nk such that n = n, + n2 + ... + nk and n, 2 3, there exists a covering of the vertices of G by disjoint cycles (C,),=,..,k with ICjl = n,, except whe