Pages that link to "Item:Q5899148"
From MaRDI portal
The following pages link to Parallel Processing and Applied Mathematics (Q5899148):
Displaying 10 items.
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)
- An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs (Q845730) (← links)
- On maximum \(P_3\)-packing in claw-free subcubic graphs (Q2025062) (← links)
- Disjoint dominating and 2-dominating sets in graphs (Q2299982) (← links)
- Packing 2- and 3-stars into cubic graphs (Q6095048) (← links)
- The maximum 4-vertex-path packing of a cubic graph covers at least two-thirds of its vertices (Q6144493) (← links)
- On the complexity of list \(\mathcal{H}\)-packing for sparse graph classes (Q6575414) (← links)
- Cutting Barnette graphs perfectly is hard (Q6589850) (← links)
- The maximum 3-star packing problem in claw-free cubic graphs (Q6645157) (← links)
- Packing 2- and 3-stars into \(( 2 , 3 )\)-regular graphs (Q6657246) (← links)