Pages that link to "Item:Q5249786"
From MaRDI portal
The following pages link to The impact of the growth rate of the packing number of graphs on the computational complexity of the independent set problem (Q5249786):
Displaying 4 items.
- On integer programming with bounded determinants (Q315478) (← links)
- A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs (Q2192977) (← links)
- König Graphs with Respect to the 4-Path and Its Spanning Supergraphs (Q4973244) (← links)
- On König graphs with respect to P4 (Q5374003) (← links)
