Small maximal independent sets and faster exact graph coloring.
Eppstein, David
Journal of Graph Algorithms and Applications, Tome 7 (2003), p. 131-140 / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2003-01-01
EUDML-ID : urn:eudml:doc:50436 
@article{02010589,
     title = {Small maximal independent sets and faster exact graph coloring.},
     journal = {Journal of Graph Algorithms and Applications},
     volume = {7},
     year = {2003},
     pages = {131-140},
     zbl = {1027.05092},
     language = {en},
     url = {http://dml.mathdoc.fr/item/02010589}
}

Eppstein, David. Small maximal independent sets and faster exact graph coloring.. Journal of Graph Algorithms and Applications, Tome 7 (2003) pp. 131-140. http://gdmltest.u-ga.fr/item/02010589/