Pages that link to "Item:Q1014835"
From MaRDI portal
The following pages link to Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph (Q1014835):
Displaying 12 items.
- Maximum bounded 3-dimensional matching is MAX SNP-complete (Q922700) (← links)
- On maximum \(P_3\)-packing in claw-free subcubic graphs (Q2025062) (← links)
- On partial descriptions of König graphs for odd paths and all their spanning supergraphs (Q2115309) (← links)
- Minimum maximal matchings in cubic graphs (Q2144321) (← links)
- (Q4807727) (← 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)
- Maximum matchings in the \(n\)-dimensional cube (Q5951061) (← 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)
- 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)
