Loop conditions for strongly connected digraphs - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Miroslav Olsák. Loop conditions for strongly connected digraphs. IJAC, 30(03):467-499, 2020. [doi]

@article{Olsak20-0,
  title = {Loop conditions for strongly connected digraphs},
  author = {Miroslav Olsák},
  year = {2020},
  doi = {10.1142/s0218196720500083},
  url = {https://doi.org/10.1142/s0218196720500083},
  researchr = {https://researchr.org/publication/Olsak20-0},
  cites = {0},
  citedby = {0},
  journal = {IJAC},
  volume = {30},
  number = {03},
  pages = {467-499},
}

runs on WebDSL