✦ LIBER ✦

Path partition for graphs with special blocks

✍ Scribed by Jun-Jie Pan; Gerard J. Chang

Book ID: 108110501
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 188 KB
Volume: 145
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2004.03.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The path-partition problem in block grap

The path-partition problem in block graphs

✍ Jing-Ho Yan; Gerard J. Chang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 408 KB

Graphs with a path partition for structu

Graphs with a path partition for structuring digital spaces

✍ Šlapal, Josef 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 469 KB

The Path Partition Conjecture is true fo

The Path Partition Conjecture is true for claw-free graphs

✍ J.E. Dunbar; M. Frick 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 148 KB

Localizing Combinatorial Properties for

Localizing Combinatorial Properties for Partitions on Block Graphs

✍ G. J. Chang; F. K. Hwang; Y. C. Yao 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 80 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

Corrigendum to “The path-partition probl

Corrigendum to “The path-partition problem in block graphs”: [Information Processing Letters 52 (1994) 317–322]

✍ Gerard J. Chang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 21 KB