Computing the independence number of dense triangle-free graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1335, Issue , 1997, Pages 101-108

  Brandt, Stephan ^a  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS;

GENERAL GRAPH; INDEPENDENCE NUMBER; MATRIX MULTIPLICATION; MINIMUM DEGREE; NP-HARD; TRIANGLE-FREE GRAPHS;

GRAPH THEORY;

EID: 84949638070     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0024491     Document Type: Conference Paper

References (23)

1. S. Arora, D. Karger and M. Karpinski, Polynomial time approximation schemes for dense instances of NP-hard problems, in: Proc. 27th ACM Symp. on Theory of Computing, 1995, pp. 284-293.
2. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN and M. SZEGEDY, Proof verification and hardness of approximation problems, in: Proc. IEEE Foundations of Computer Science, 1992, pp. 14-23.
3. S. ARORA and C. LUND Hardness of approximations, in: Approximation algorithms for NP-hard problems (D. S. Hochbaum, ed.), PWS, Boston, 1995, pp. 399-446.
4. D. BAUER, J. VAN DEN HEUVEL and E. SCHMEICHEL, Toughness and triangle-free graphs, J. Combin. Theory Set. B 65 (1995), 208-221.
5. J. A. BONDY and V. CHVATAL, A method in graph theory, Discrete Math. 15 (1976), 111-135.
6. S. Brandt Cycles and paths in triangle-free graphs, in: The Mathematics of Paul Erdős (R. L. Graham and J. Nešetřil, eds.), Springer, 1996, pp. 32-42.
7. S. Brandt, On the structure of dense triangle-free graphs, submitted.
8. S. Brandt, Triangle-free graphs whose independence number equals the degree, manuscript.
9. D. COPPERSMITH and S. WINOGRAD Matrix multiplication via arithmetic progressions, J. Symbolic Comput. 9 (1990), 251-280.
10. G. A. DIRAC, Some theorems on abstract graphs, Proc. London Math. Soc. (3) 2 (1952), 69-81.
11. P. Erdős and M. Simonovits On a valence problem in extremal graph theory, Discrete Math. 5 (1972), 323-334.
12. K. EDWARDS, The complexity of colouring problems on dense graphs, Theoretical Comp. Sci. 43 (1986), 337-343.
13. M. R. GAREY and D. S. JOHNSON, Computers and intractability: a guide to NP-completeness, W. H. Freeman, New York, 1979.
14. R. HÄGGKVIST, On the structure of non-hamiltonian graphs I, Comb., Prob. and Comp. 1 (1992), 27-34.
15. G. JIN, Triangle-free graphs with high minimal degrees, Comb. Prob. and Comp. 2, (1993), 479-490.
16. G. JIN, Triangle-free four-chromatic graphs, Discrete Math. 145 (1995), 151-170.
17. 1/2E) algorithm for finding maximum matching in general graphs, Proc. 21st Ann. Syrup. on Foundations of Computer Sc. IEEE, New York (1980), 17-27.
18. J. Nešetiřil and S. Poljak, On the complexity of the subgraph problem Comment. Math. Univ. Carolin. 26 (1985), 415-419.
19. J. PACH, Graphs whose every independent set has a common neighbour, Discrete Math. 37 (1981), 217-228.
20. S. POLJAK, A note on stable sets and colorings of graphs, Comment. Math. Univ. Carolinae 15 (1974), 307-309.
21. Z. Ryjáček, On a closure concept in claw-free graphs, to appear in J. Combin. Theory Ser. B.
22. H. J. VELDMAN, Personal communication, 1994.
23. D. B. WEST, Introduction to graph theory, Prentice Hall, 1996.