The Steiner cycle and path cover problem on interval graphs (bibtex)

by Ante Ćustić and Stefan Lendl

Reference:

Ante Ćustić and Stefan Lendl, The Steiner cycle and path cover problem on interval graphs, Journal of combinatorial optimization, 43, 226-234, (2022).

Bibtex Entry:

@Article{CusticLendl2021,
  arxiv       = {10.1007/s10878-021-00757-7},
  author      = {{\'C}usti{\'c}, Ante and Lendl, Stefan},
  journal     = {Journal of combinatorial optimization},
  title       = {The {S}teiner cycle and path cover problem on interval graphs},
  year        = {2022},
  oatype      = {Hybrid},
  pages       = {226-234},
  volume      = {43},
  doi         = {10.1007/s10878-021-00757-7},
  groups      = {Project07 (Klinz), MultipleStudents, Student},
  xxpublisher = {Springer},
}