An El-Zah�r type condition ensuring path-factors

DOI10.1002/(SICI)1097-0118(199805)28:1%3C39::AID-JGT4%3E3.0.CO;2-GMaRDI QIDQ4242796zbMATH OpenOpenAlexFDO

Authors Robert Johansson

Publication date 11 May 1999

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199805)28:1%3C39::aid-jgt4%3E3.0.co;2-g

zbMATH Keywords

connected graphpath-factorsspanning subgraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A degree sum condition for the existence of a path-factor.
• Degree sums and path-factors in graphs
• A degree condition for the existence ofk-factors
• Connected \([a,b]\)-factors in graphs
• scientific article; zbMATH DE number 2188351

Cited in

(15)

• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Almost-spanning subgraphs with bounded degree in dense graphs
• Generalized Turán number for linear forests
• Some sufficient conditions for path-factor uniform graphs
• A degree sum condition for the existence of a path-factor.
• An asymptotic version of a conjecture by Enomoto and Ota
• Vertex-disjoint subgraphs with high degree sums
• Partitions of a graph into paths with prescribed endvertices and lengths
• Path factors and neighborhoods of independent sets in graphs
• Isolated toughness and path-factor uniform graphs. II.
• On path-factor critical uniform graphs
• A spectral condition for the existence of component factors in graphs
• Path-factors in the square of a tree
• \(K_{1,3}\)-factors in graphs

This page was built for publication: An El-Zah�r type condition ensuring path-factors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242796)