Binary Covering Arrays and Existentially Closed Graphs

Charles J. Colbourn, Gerzson Kéri. Binary Covering Arrays and Existentially Closed Graphs. In Yeow Meng Chee, Chao Li, San Ling, Huaxiong Wang, Chaoping Xing, editors, Coding and Cryptology, Second International Workshop, IWCC 2009, Zhangjiajie, China, June 1-5, 2009. Proceedings. Volume 5557 of Lecture Notes in Computer Science, pages 22-33, Springer, 2009. [doi]

@inproceedings{ColbournK09,
  title = {Binary Covering Arrays and Existentially Closed Graphs},
  author = {Charles J. Colbourn and Gerzson Kéri},
  year = {2009},
  doi = {10.1007/978-3-642-01877-0_3},
  url = {http://dx.doi.org/10.1007/978-3-642-01877-0_3},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/ColbournK09},
  cites = {0},
  citedby = {0},
  pages = {22-33},
  booktitle = {Coding and Cryptology, Second International Workshop, IWCC 2009, Zhangjiajie, China, June 1-5, 2009. Proceedings},
  editor = {Yeow Meng Chee and Chao Li and San Ling and Huaxiong Wang and Chaoping Xing},
  volume = {5557},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-01813-8},
}