Enumerating maximal independent sets with applications to graph colouring

Operations Research Letters

Volumn 32, Issue 6, 2004, Pages 547-556

  Byskov, Jesper Makholm ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Chromatic number; Extremal graphs; Graph algorithms; Graph colouring; Maximal independent set

Indexed keywords

ALGORITHMS; COLOR; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

CHROMATIC NUMBER; EXTREMAL GRAPHS; GRAPH ALGORITHMS; GRAPH COLOURING; MAXIMAL INDEPENDENT SET;

SET THEORY;

EID: 3042736584     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2004.03.002     Document Type: Article

References (14)

1. I.M. Bomze, M. Budinich, P.M. Pardalos, M. Pelillo, The maximum clique problem, in: D.-Z. Du, P.M. Pardalos (Eds.), Handbook of Combinatorial Optimization, Vol. 4, Kluwer Academic Publishers, Boston, MA, 1999, pp. 1-74.
2. n) using maximal independent sets, Research Series RS-02-45, BRICS, Department of Computer Science, University of Aarhus, December 2002; URL http://www.brics.dk/RS/02/45/ .
3. J.M. Byskov, Algorithms for k -colouring and finding maximal independent sets, in: Proceedings of the 14th Symposium on Discrete Algorithms, SIAM, 2003, pp. 456-457.
4. Christofides N. An algorithm for the chromatic number of a graph. Comput. J. 14(1):1971;38-39.
5. C. Croitoru, On stables in graphs, in: Proceedings of the Third Colloqium on Operations Research (Cluj-Napoca, 1978), University "Babeş- Bolyai", Cluj-Napoca, 1979, pp. 55-60.
6. D. Eppstein, Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction, in: Proceedings of the 12th Symposium on Discrete Algorithms, ACM and SIAM, 2001, pp. 329-337.
7. D. Eppstein, Small maximal independent sets and faster exact graph coloring, J. Graph Algorithms & Applications 7 (2) (2003) 131-140.
8. Hujter M., Tuza Z. The number of maximal independent sets in triangle-free graphs. SIAM J. Discrete Math. 6(2):1993;284-288.
9. Lawler E.L. A note on the complexity of the chromatic number problem. Inf. Process. Lett. 5(3):1976;66-67.
10. B.A. Madsen, J.M. Nielsen, B. Skjernaa, On the number of maximal bipartite subgraphs of a graph, Research Series RS-02-17, BRICS, Department of Computer Science, University of Aarhus, April 2002; URL http://www.brics.dk/RS/ 02/17/ .
11. R.E. Miller, D.E. Muller, A problem of maximum consistent subsets, Research Report RC-240, IBM Research Center, March 1960.
12. Moon J.W., Moser L. On cliques in graphs. Israel J. Math. 3:1965;23-28.
13. Schiermeyer I. Fast exact colouring algorithms. Tatra Mountains Math. Publ. 9:1996;15-30.
14. Tsukiyama S., Ide M., Ariyoshi H., Shirakawa I. A new algorithm for generating all the maximal independent sets. SIAM J. Comput. 6(3):1977;505-517.