Publication:4304413
From MaRDI portal
zbMath0821.68095MaRDI QIDQ4304413
No author found.
Publication date: 3 October 1995
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Related Items
The optimal bound on the 3-independence number obtainable from a polynomial-type method, On the complexity of distance-\(d\) independent set reconfiguration, Parameterized maximum path coloring, Spectral bounds for the \(k\)-independence number of a graph, On the 2-packing differential of a graph, Optimization of eigenvalue bounds for the independence and chromatic number of graph powers, A new class of polynomials from the spectrum of a graph, and its application to bound the \(k\)-independence number, The \(k\)-independence number of \(t\)-connected graphs, On the \(k\)-independence number of graphs, Sharp upper bounds on the \(k\)-independence number in graphs with given minimum and maximum degree, On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship, Parameterized Maximum Path Coloring