Connected factors in graphs -- a survey

DOI10.1007/S00373-004-0587-7zbMath1066.05110OpenAlexW2123767164MaRDI QIDQ1777234

Preben Dahl Vestergaard, Mekkia Kouider

Publication date: 12 May 2005

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-004-0587-7

zbMATH Keywords

\(k\)-treespanning subgraph\(k\)-walkconnected factor\(k\)-trail

Mathematics Subject Classification ID

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

Related Items (20)

An Extension of Cui-Kano's Characterization on Graph Factors ⋮ Approximation and Exact Algorithms for Special Cases of Connected f-Factors ⋮ Sufficient condition for the existence of an even \([a,b\)-factor in graph] ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Neighborhood-union condition for an \([a, b\)-factor avoiding a specified Hamiltonian cycle] ⋮ On the complexity landscape of connected \(f\)-factor problems ⋮ Stability number and \(f\)-factors in graphs ⋮ Spanning trees: A survey ⋮ A note on the existence of fractional \(f\)-factors in random graphs ⋮ Binding number and Hamiltonian \((g,f)\)-factors in graphs ⋮ Induced claws and existence of even factors of graphs ⋮ The existence of even factors in iterated line graphs ⋮ Minimum degree, independence number and pseudo \([2, b\)-factors in graphs] ⋮ Unnamed Item ⋮ The stability number and connected \([k,k+1\)-factor in graphs] ⋮ The structure of even factors in claw-free graphs ⋮ Editing to Connected F-Degree Graph ⋮ Connected \(k\)-factors in bipartite graphs ⋮ On Cui-Kano's Characterization Problem on Graph Factors ⋮ Proof of a conjecture on the spectral radius condition for \([a,b\)-factors]

This page was built for publication: Connected factors in graphs -- a survey