scientific article; zbMATH DE number 1251573
From MaRDI portal
Publication:4229265
zbMATH Open0918.05086MaRDI QIDQ4229265FDOQ4229265
Authors: N. V. R. Mahadev, Bruce Reed 
Publication date: 19 August 1999
Title of this publication is not available (Why is that?)
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Smallest-last ordering and clustering and graph coloring algorithms
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- k-Components, Clusters and Slicings in Graphs
- Four classes of perfectly orderable graphs
- An inequality for the chromatic number of a graph
- Polynomially solvable cases for the maximum stable set problem
Cited In (8)
- Extending the MAX algorithm for maximum independent set
- New properties of perfectly orderable graphs and strongly perfect graphs
- On vertex orderings and the stability number in triangle-free graphs
- Minimum degree algorithms for stability number
- Stable sets in two subclasses of banner-free graphs
- A note on \(\alpha\)-redundant vertices in graphs
- On sequential heuristic methods for the maximum independent set problem
- New sufficient conditions for \(\alpha\)-redundant vertices
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4229265)
