The following pages link to (Q4304413):
Displayed 12 items.
- Parameterized maximum path coloring (Q392021) (← links)
- Spectral bounds for the \(k\)-independence number of a graph (Q501229) (← links)
- On the 2-packing differential of a graph (Q2044595) (← links)
- Optimization of eigenvalue bounds for the independence and chromatic number of graph powers (Q2065879) (← links)
- A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number (Q2197265) (← links)
- The \(k\)-independence number of \(t\)-connected graphs (Q2244182) (← links)
- On the \(k\)-independence number of graphs (Q2317661) (← links)
- Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree (Q2657095) (← links)
- On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship (Q2700618) (← links)
- Parameterized Maximum Path Coloring (Q2891353) (← links)
- The optimal bound on the 3-independence number obtainable from a polynomial-type method (Q6041879) (← links)
- On the complexity of distance-\(d\) independent set reconfiguration (Q6091168) (← links)