𝔖 Bobbio Scriptorium
✦   LIBER   ✦

L(\(d\),1)-labelings of the edge-path-replacement by factorization of graphs

✍ Scribed by Karst, Nathaniel; Oehrlein, Jessica; Troxell, Denise Sakai; Zhu, Junjie

Book ID
120694284
Publisher
Springer US
Year
2013
Tongue
English
Weight
215 KB
Volume
30
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On L(d,1)-labelings of graphs
On L(d,1)-labelings of graphs
✍ Gerard J. Chang; Wen-Tsai Ke; David Kuo; Daphne D.-F. Liu; Roger K. Yeh πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 116 KB
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.