✦ LIBER ✦

Directed graphs with unique paths of fixed length

✍ Scribed by C.W.H Lam; J.H van Lint

Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 298 KB
Volume: 24
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(78)90052-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Spectra and elementary cycles of the dig

Spectra and elementary cycles of the digraphs with unique paths of fixed length

✍ Yaokun Wu; Qiao Li; Jingjie Li 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 129 KB

A fast randomized algorithm for partitio

A fast randomized algorithm for partitioning a graph into paths of fixed length

✍ Leen Stougie 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 652 KB

On paths with the shortest average arc l

On paths with the shortest average arc length in weighted graphs

✍ Shmuel Wimer; Israel Koren; Israel Cederbaum 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 749 KB

The shortest-path problem for graphs wit

The shortest-path problem for graphs with random arc-lengths

✍ A.M. Frieze; G.R. Grimmett 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 760 KB

Partitions of a graph into paths with pr

Partitions of a graph into paths with prescribed endvertices and lengths

✍ Hikoe Enomoto; Katsuhiro Ota 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 95 KB 👁 3 views

For a graph G, let ' 2 (G ) denote the minimum degree sum of a pair of nonadjacent vertices. We conjecture that if |V(G)| n i 1 k a i and ' 2 (G ) ! n k À 1, then for any k vertices v 1 , v 2 , F F F , v k in G, there exist vertex-disjoint paths P 1 , P 2 , F F F , P k such that |V (P i )| a i and v

Decompositions of highly connected graph

Decompositions of highly connected graphs into paths of length 3

✍ Carsten Thomassen 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB 👁 1 views

## Abstract We prove that a 171‐edge‐connected graph has an edge‐decomposition into paths of length 3 if and only its size is divisible by 3. It is a long‐standing problem whether 2‐edge‐connectedness is sufficient for planar triangle‐free graphs, and whether 3‐edge‐connectedness suffices for graph