\(P_3\)-factors in the square of a tree
From MaRDI portal
Publication:2657058
DOI10.1007/s00373-020-02184-7zbMath1459.05136OpenAlexW3047397722MaRDI QIDQ2657058
Publication date: 17 March 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-020-02184-7
Trees (05C05) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (3)
\(P_k\)-factors in squares and line graphs of trees ⋮ Binding number and path-factor critical deleted graphs ⋮ Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius
Cites Work
- Unnamed Item
- Unnamed Item
- On factors with given components
- Graph factors and factorization: 1985--2003: a survey
- Path-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
- Packing paths of length at least two
- On packing 3-vertex paths in a graph
- On the Complexity of General Graph Factor Problems
- Graph Factors and Matching Extensions
- Path and cycle factors of cubic bipartite graphs
- Path factors in cubic graphs
- Factors and factorizations of graphs—a survey
- Path factors of bipartite graphs
- On the completeness of a generalized matching problem
- The Factors of Graphs
- Path factors in claw-free graphs
This page was built for publication: \(P_3\)-factors in the square of a tree