Small maximal independent sets and faster exact graph coloring

Graph Algorithms and Applications 4

Volumn , Issue , 2006, Pages 131-140

  Eppstein, David ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84969626050     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1142/9789812773296_0006     Document Type: Chapter

References (8)

1. R. Beigel and D. Eppstein. 3-coloring in time 0(1.3446"): a no-MIS algorithm. Proc. 36th Symp. Foundations of Computer Science, pp. 444-453. IEEE, October 1995, ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/1995/TR95-033/index.html.
2. R. Beigel and D. Eppstein. 3-coloring in time 0(1.3289"). ACM Computing Research Repository, June 2000, arXiv:cs.DS/0006046.
3. C. Croitoru. On stables in graphs. Proc. 3rd Coll. Operations Research, pp. 55-60. Babes-Bolyai Univ., Cluj-Napoca, Romania, 1979.
4. D. Eppstein. Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction. Proc. 12th Symp. Discrete Algorithms, pp. 329-337. ACM and SIAM, January 2001, arXiv:cs.DS/0009006.
5. E. L. Lawler. A note on the complexity of the chromatic number problem. Inf. Proc. Lett. 5(3):66-67, August 1976.
6. J. W. Moon and L. Moser. On cliques in graphs. Israel J. Math. 3:23-28, 1965.
7. J. M. Nielsen. On the number of maximal independent sets in a graph. Tech. Rep. RS-02-15, Center for Basic Research in Computer Science (BRICS), April 2002, http://www.brics.dk/RS/02/15/.
8. I. Schiermeyer. Deciding 3-colourability in less than 0(1.415") steps. Proc. 19th Int. Worksh. Graph-Theoretic Concepts in Computer Science, pp. 177-182. Springer-Verlag, Lecture Notes in Comp. Sci. 790, 1994.