Path factors in claw-free graphs
From MaRDI portal
Publication:5957707
DOI10.1016/S0012-365X(01)00214-XzbMath0992.05060OpenAlexW2122666717MaRDI QIDQ5957707
Ken-ichi Kawarabayashi, Haruhide Matsuda, Atsushi Kaneko, Kiyoshi Ando, Yoshimi Egawa
Publication date: 13 March 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00214-x
Related Items (13)
Path factors in subgraphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ \(P_3\)-factors in the square of a tree ⋮ Isolated toughness and path-factor uniform graphs. II. ⋮ Path-factors in the square of a tree ⋮ 2-factors in claw-free graphs with lower bounds cycle lengths ⋮ Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs ⋮ Path factors and parallel knock-out schemes of almost claw-free graphs ⋮ Unnamed Item ⋮ On path factors of \((3,4)\)-biregular bigraphs ⋮ Locating-dominating sets: from graphs to oriented graphs ⋮ Path factors and line graphs ⋮ The existence of path-factor covered graphs
This page was built for publication: Path factors in claw-free graphs