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

Covering a graph by a set of paths originating at a single vertex

โœ Scribed by I. S. Grunskii; D. V. Speranskii

Publisher
Springer US
Year
1975
Tongue
English
Weight
466 KB
Volume
10
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Covering the Edges of a Connected Graph
Covering the Edges of a Connected Graph by Paths
โœ L. Pyber ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 316 KB

We prove that every connected graph on n vertices can be covered by at most nร‚2+O(n 3ร‚4 ) paths. This implies that a weak version of a well-known conjecture of Gallai is asymptotically true.

Graphs defined by coverings of a set
Graphs defined by coverings of a set
โœ R. K. Guy; E. C. Milner ๐Ÿ“‚ Article ๐Ÿ“… 1968 ๐Ÿ› Akadmiai Kiad ๐ŸŒ English โš– 703 KB
Relating path coverings to vertex labell
Relating path coverings to vertex labellings with a condition at distance two
โœ John P. Georges; David W. Mauro; Marshall A. Whittlesey ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 592 KB

A blabelling of graph G is an integer labelling of V(G) such that adjacent vertices have labels that differ by at least two and vertices distance two apart have labels that differ by at least one. The 1 number of G, I(G), is the minimum span of labels over all such labellings. Griggs and Yeh have st