The Edmonds-Gallai decomposition for the k-piece packing problem
From MaRDI portal
(Redirected from Publication:1773199)
The Edmonds-Gallai decomposition for the \(k\)-piece packing problem
The Edmonds-Gallai decomposition for the \(k\)-piece packing problem
A \(k\)-piece is a simple, connected graph with the highest degree exactly \(k\). The \(k\)-piece packing of a graph \(G\) is a subgraph \(P\) of \(G\) such that each connected component of \(P\) is a \(k\)-piece. In the paper, an Edmonds-Gallai type decomposition for maximal \(k\)-piece packings is given. Moreover, it is proved that the vertex sets coverable by \(k\)-piece packings have a certain matroidal structure.
Recommendations
Cited in
(6)- Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
- An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem
- Packing $k$-Matchings and $k$-Critical Graphs
- The nonnegative node weight \(j\)-restricted \(k\)-matching problems
- The k‐piece packing problem
- A note on \({\mathtt V}\)-free 2-matchings
This page was built for publication: The Edmonds-Gallai decomposition for the \(k\)-piece packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1773199)
