𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graphs with a path partition for structuring digital spaces

✍ Scribed by Šlapal, Josef

Book ID
122420159
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
469 KB
Volume
233
Category
Article
ISSN
0020-0255

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On Kotzig's conjecture for graphs with a
On Kotzig's conjecture for graphs with a regular path-connectedness
✍ Keyi Xing; Baosheng H.U 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 397 KB

Kotzig (see Bondy and Murty (1976)) conjectured that there exists no graph with the property that every pair of vertices is connected by a unique path of length k, k>2. Here we prove this conjecture for k> 12.