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