Tournaments whose indecomposability graph admits a vertex cover of size 2 - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Imed Boudabbous. Tournaments whose indecomposability graph admits a vertex cover of size 2. Ars Comb., 128:63-82, 2016.

@article{Boudabbous16,
  title = {Tournaments whose indecomposability graph admits a vertex cover of size 2},
  author = {Imed Boudabbous},
  year = {2016},
  researchr = {https://researchr.org/publication/Boudabbous16},
  cites = {0},
  citedby = {0},
  journal = {Ars Comb.},
  volume = {128},
  pages = {63-82},
}

runs on WebDSL