Sridharan, S., On the Berge's strong path partition conjecture, Discrete Mathematics 112 (1993) 289-293. It is proved that for every k-optimal path partition of a digraph in which each component contains at most one cycle, there exists a partial k-coloring which colors strongly every path of the pa
✦ LIBER ✦
Berge's conjecture on directed path partitions—a survey
✍ Scribed by Irith Ben-Arroyo Hartman
- Book ID
- 108113628
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 294 KB
- Volume
- 306
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
On the Berge's strong path partition con
✍
S. Sridharan
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 312 KB
On the strong path partition conjecture
✍
S. Sridharan
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 354 KB
A bijective proof of Kadell's conjecture
✍
Dongsu Kim
📂
Article
📅
1990
🏛
Springer Japan
🌐
English
⚖ 273 KB
On a conjecture of Herzer concerning lin
✍
Ralph-Hardo Schulz
📂
Article
📅
1986
🏛
Springer
🌐
English
⚖ 201 KB
On a Conjecture of Nicolas–Sárközy about
✍
F. Ben saı̈d
📂
Article
📅
2002
🏛
Elsevier Science
🌐
English
⚖ 152 KB
Let N be the set of positive integers, B ¼ fb 1 5 . . . 5b k g & N, N 2 N, and N5b k . For i ¼ 0 or 1, A ¼ A i ðB; NÞ is the set (introduced by Nicolas, Ruzsa, and Sa´rko¨zy, J. Number Theory 73 (1998), 292-317) such that A \ f1; . . . ; Ng ¼ B and pðA; nÞ iðmod2Þ for n 2 N; n4N, where pðA; nÞ denot
A note on path kernels and partitions
✍
Wenjie He; Baoli Wang
📂
Article
📅
2010
🏛
Elsevier Science
🌐
English
⚖ 200 KB