An El-Zah�r type condition ensuring path-factors
From MaRDI portal
Publication:4242796
DOI<39::AID-JGT4>3.0.CO;2-G 10.1002/(SICI)1097-0118(199805)28:1<39::AID-JGT4>3.0.CO;2-GzbMath0919.05037OpenAlexW4235076888MaRDI QIDQ4242796
Publication date: 11 May 1999
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199805)28:1<39::aid-jgt4>3.0.co;2-g
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Generalized Turán number for linear forests, Vertex-disjoint subgraphs with high degree sums, Path factors and neighborhoods of independent sets in graphs, Isolated toughness and path-factor uniform graphs. II., Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Some sufficient conditions for path-factor uniform graphs, Path-factors in the square of a tree, Partitions of a graph into paths with prescribed endvertices and lengths, An asymptotic version of a conjecture by Enomoto and Ota, \(K_{1,3}\)-factors in graphs, Almost-spanning subgraphs with bounded degree in dense graphs