Packing paths of length at least two
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 15366 (Why is no real title available?)
- scientific article; zbMATH DE number 1342133 (Why is no real title available?)
- A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
- Factors and factorizations of graphs—a survey
- Matching theory
- On the completeness of a generalized matching problem
- Path factors of bipartite graphs
- Some Generalizations of the Problem of Distinct Representatives
- Subgraphs with prescribed valencies
- The k‐piece packing problem
- The Factors of Graphs
Cited in
(46)- Path factors in subgraphs
- Two Sufficient Conditions for Graphs to Admit Path Factors
- Sufficient conditions for the existence of path-factors with given properties
- Binding number conditions for path-factor uniform graphs
- Path factors and parallel knock-out schemes of almost claw-free graphs
- The existence of path-factor covered graphs
- Sufficient conditions for graphs to have strong parity factors
- Packing paths: recycling saves time
- On \(P_{\geq 3}\)-factor deleted graphs
- Faster algorithm for finding maximum 1-restricted simple 2-matchings
- Binding number and path-factor critical deleted graphs
- Some existence theorems on path factors with given properties in graphs
- Shortest \((A+B)\)-path packing via hafnian
- Component factors with large components in graphs
- A note on \({\mathtt V}\)-free 2-matchings
- Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
- The existence of \(P_{\geq3}\)-factor covered graphs
- Some results about ID-path-factor critical 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
- \(P_3\)-factors in the square of a tree
- The path set packing problem
- Odd path packings
- Packing paths perfectly
- Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
- Independence number and minimum degree for path-factor critical uniform graphs
- The nonnegative node weight \(j\)-restricted \(k\)-matching problems
- An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem
- Characterizing path-factor uniform graphs with respect to the degree sum of non-adjacent vertices
- Illuminating disjoint line segments in the plane
- Forbidden restrictions and the existence of \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor
- Characterizing spanning trees via the size or the spectral radius of graphs
- Star-factors with large components, fractional k-extendability and spectral radius in graphs
- On graph-based network parameters and component factors in networks
- Component factors and degree sum conditions in graphs
- Toughness, isolated toughness and path factors in graphs
- Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs
- Path-factors in the square of a tree
- Degree sum conditions for path-factor uniform graphs
- On path-factor critical uniform graphs
- On path-factor critical deleted (or covered) graphs
- Isolated toughness and path-factor uniform graphs. II.
- The longest segment in the complement of a packing
- Packings and 2-packings of A-paths
- Packing $k$-Matchings and $k$-Critical Graphs
- The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree
This page was built for publication: Packing paths of length at least two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827782)
