scientific article; zbMATH DE number 1251573
From MaRDI portal
Publication:4229265
zbMath0918.05086MaRDI QIDQ4229265
N. V. R. Mahadev, Bruce A. Reed
Publication date: 19 August 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
Stable sets in two subclasses of banner-free graphs ⋮ Minimum degree algorithms for stability number ⋮ New properties of perfectly orderable graphs and strongly perfect graphs ⋮ On sequential heuristic methods for the maximum independent set problem ⋮ Extending the MAX algorithm for maximum independent set ⋮ New sufficient conditions for \(\alpha\)-redundant vertices
Cites Work
- Unnamed Item
- Unnamed Item
- Polynomially solvable cases for the maximum stable set problem
- Smallest-last ordering and clustering and graph coloring algorithms
- Four classes of perfectly orderable graphs
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- An inequality for the chromatic number of a graph
- k-Components, Clusters and Slicings in Graphs
This page was built for publication:
