Camouflaging independent sets in quasi-random graphs

Mark Brockington, Joseph C. Culberson. Camouflaging independent sets in quasi-random graphs. In David S. Johnson, Michael A. Trick, editors, Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993. Volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 75-88, DIMACS/AMS, 1993.

@inproceedings{BrockingtonC93,
  title = {Camouflaging independent sets in quasi-random graphs},
  author = {Mark Brockington and Joseph C. Culberson},
  year = {1993},
  researchr = {https://researchr.org/publication/BrockingtonC93},
  cites = {0},
  citedby = {0},
  pages = {75-88},
  booktitle = {Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993},
  editor = {David S. Johnson and Michael A. Trick},
  volume = {26},
  series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
  publisher = {DIMACS/AMS},
}