✦ LIBER ✦

Path decompositions and Gallai's conjecture

✍ Scribed by Genghua Fan

Book ID: 108167373
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 198 KB
Volume: 93
Category: Article
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2004.09.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An erdős—Gallai conjecture

✍ L. Pyber 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 698 KB

Gallai's Conjecture For Graphs of Girth

Gallai's Conjecture For Graphs of Girth at Least Four

✍ Harding, Peter; McGuinness, Sean 📂 Article 📅 2013 🏛 John Wiley and Sons 🌐 English ⚖ 762 KB

Path decompositions of multigraphs

✍ Leizhen Cai 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 494 KB

Let G be a loopless finite multigraph. For each vertex x of G, denote its degree and multiplicity by d(x) and p(x) respectively. Define the least even integer 2 p(x), if d(x) is even, the least odd integer 2 p(x), if d(x) is odd. In this paper it is shown that every multigraph G admits a faithful p

Decompositions and the relative tubular

Decompositions and the relative tubular neighbourhood conjecture

✍ C.P. Rourke; B.J. Sanderson 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 350 KB

Spanning a strong digraph byαcircuits: A

Spanning a strong digraph byαcircuits: A proof of Gallai’s conjecture

✍ Stéphane Bessy; Stéphan Thomassé 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 164 KB

On the Berge's strong path partition con

On the Berge's strong path partition conjecture

✍ S. Sridharan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 312 KB

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