Independent sets in graphs with triangles

DOI10.1016/0020-0190(96)00072-5zbMath0875.68703OpenAlexW2025141300MaRDI QIDQ1349947

Thomas Hofmeister, Hanno Lefmann

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00072-5

zbMATH Keywords

AlgorithmsIndependent sets

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (1)

Interpolating between bounds on the independence number

Cites Work

• A note on the independence number of triangle-free graphs
• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• A note on Ramsey numbers
• A dense infinite Sidon sequence
• On Turan's theorem for sparse graphs
• A note on the independence number of triangle-free graphs. II
• Greed is good
• On the independence number of sparse graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Independent sets in graphs with triangles