SIAM Digital Library
 
 
 

You are not logged in Logged Out Log In

SIAM J. on Discrete Mathematics / Volume 9 / Issue 4

SIAM J. Discrete Math. 9, pp. 674-681 (8 pages)

Finding Independent Sets in Triangle-Free Graphs

Kathryn Fraughnaugh and Stephen C. Locke

Full Text: Download PDF | Buy PDF (US$25) | View Cart
Finding a maximum independent set in a graph is well known to be an NP-complete problem. Here an $O(n^2 )$-time algorithm that finds an independent set of order at least $(6n - m)/13$ in a triangle-free graph with $n$ vertices and $m$ edges is presented. A tight lower bound on independence in 4-regular triangle-free graphs is $4n/13$, so the bound is sharp for this class.

© 1996 Society for Industrial and Applied Mathematics

RELATED DATABASES

To view database links for this article, you need to log in.

KEYWORDS

AMS Subject Headings

05C

PUBLICATION DATA

ISSN

0895-4801 (print)  
1095-7146 (online)

Publisher

$abstract.society.value is a Member of CrossRef Society for Industrial and Applied Mathematics

ARTICLE DATA

History
Received April 05, 1994
Accepted December 28, 1995
Digital Object Identifier
http://dx.doi.org/10.1137/S0895480194266434

For access to fully linked references, you need to log in.

Close

Your Recent History Recent History Help

Recently Viewed

  1. Finding Independent Sets in Triangle-Free Graphs
  2. Cohen–Macaulay Graphs and Face Vectors of Flag Complexes
  3. Forbidden Induced Subgraphs of Double-split Graphs
  4. Roman Domination on 2-Connected Graphs
  5. A Deterministic Algorithm for the Frieze–Kannan Regularity Lemma
© SIAM By using SIAM Publications Online you agree to abide by the Terms and Conditions of Use. Banner art adapted from a figure by Hinke M. Osinga and Bernd Krauskopf (University of Bristol, UK).
close