Packing paths of length at least two
From MaRDI portal
Publication:1827782
DOI10.1016/j.disc.2004.01.016zbMath1042.05084OpenAlexW1963596676MaRDI QIDQ1827782
Gyula Y. Katona, Zoltán Király, Mikio Kano
Publication date: 6 August 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.01.016
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (30)
On path-factor critical deleted (or covered) graphs ⋮ Path factors in subgraphs ⋮ \(P_3\)-factors in the square of a tree ⋮ The existence of \(P_{\geq3}\)-factor covered graphs ⋮ Some results about ID-path-factor critical graphs ⋮ Forbidden restrictions and the existence of \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor ⋮ Binding number and path-factor critical deleted graphs ⋮ Isolated toughness and path-factor uniform graphs. II. ⋮ Two Sufficient Conditions for Graphs to Admit Path Factors ⋮ Sufficient conditions for graphs to have strong parity factors ⋮ Some existence theorems on path factors with given properties in graphs ⋮ Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius ⋮ Sun toughness and path-factor uniform graphs ⋮ Packing $k$-Matchings and $k$-Critical Graphs ⋮ Packing paths: recycling saves time ⋮ Illuminating disjoint line segments in the plane ⋮ Path-factors in the square of a tree ⋮ Component factors with large components in graphs ⋮ Path factors and parallel knock-out schemes of almost claw-free graphs ⋮ Faster algorithm for finding maximum 1-restricted simple 2-matchings ⋮ A note on \({\mathtt V}\)-free 2-matchings ⋮ Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs ⋮ An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem ⋮ Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs ⋮ Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs ⋮ The Nonnegative Node Weight j-Restricted k-Matching Problems ⋮ The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree ⋮ The existence of path-factor covered graphs ⋮ TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS ⋮ On \(P_{\geq 3}\)-factor deleted graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Matching theory
- A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
- Some Generalizations of the Problem of Distinct Representatives
- Factors and factorizations of graphs—a survey
- Path factors of bipartite graphs
- On the completeness of a generalized matching problem
- The k‐piece packing problem
- Subgraphs with prescribed valencies
- The Factors of Graphs
This page was built for publication: Packing paths of length at least two
