Finding Independent Sets in Triangle-Free Graphs

DOI10.1137/S0895480194266434zbMath0862.05074OpenAlexW2023997521MaRDI QIDQ4717575

Kathryn Fraughnaugh, Stephen C. Locke

Publication date: 1 December 1996

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480194266434

zbMATH Keywords

independent settriangle-free graphefficient algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Turán type results for distance graphs ⋮ Finding independent sets in \(K_4\)-free 4-regular connected graphs ⋮ Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs ⋮ How to guard orthogonal polygons: diagonal graphs and vertex covers

This page was built for publication: Finding Independent Sets in Triangle-Free Graphs