Path factors of bipartite graphs
From MaRDI portal
Publication:4284102
DOI10.1002/jgt.3190180207zbMath0798.05044OpenAlexW1998093813MaRDI QIDQ4284102
Publication date: 1994
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190180207
Related Items
On path-factor critical deleted (or covered) graphs, \(P_3\)-factors in the square of a tree, A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two, The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices, Path-factor critical covered graphs and path-factor uniform graphs, Path-factors in the square of a tree, The path partition problem and related problems in bipartite graphs, Path factors and parallel knock-out schemes of almost claw-free graphs, On path factors of \((3,4)\)-biregular bigraphs, Packing paths of length at least two, The existence of path-factor covered graphs
Cites Work
