The following pages link to Chain packing in graphs (Q808291):
Displayed 16 items.
- An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs (Q845730) (← links)
- Hamiltonicity and pancyclicity of Cartesian products of graphs (Q1045164) (← links)
- A parallel algorithm for the maximum 2-chain edge packing problem (Q1123636) (← links)
- Edge-disjoint packings of graphs (Q1326750) (← links)
- A remark on maximum matching of line graphs (Q1377734) (← links)
- On partial descriptions of König graphs for odd paths and all their spanning supergraphs (Q2115309) (← links)
- A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs (Q2192977) (← links)
- Fixed-parameter tractable algorithms for tracking shortest paths (Q2210499) (← links)
- Edge-disjoint packing of stars and cycles (Q2629232) (← links)
- Hamiltonicity and pancyclicity of generalized prisms (Q3439413) (← links)
- Edge-Disjoint Packing of Stars and Cycles (Q3467879) (← links)
- Packing $k$-Matchings and $k$-Critical Graphs (Q4602858) (← links)
- König Graphs with Respect to the 4-Path and Its Spanning Supergraphs (Q4973244) (← links)
- On the König graphs for a 5-path and its spanning supergraphs (Q5090154) (← links)
- Approximation algorithms for the design of SDH/SONET networks (Q5479829) (← links)
- Complexity, algorithmic, and computational aspects of a dial-a-ride type problem (Q6113356) (← links)