Graphs with two moplexes are more than perfect (bibtex)
by , , , ,
Reference:
Graphs with two moplexes are more than perfectClement Dallard, Robert Ganian, Meike Hatzel, Matjaz Krnc, Martin MilanicProceedings of the 11th Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2021), 2021, Elsevier.Note: to appear
Bibtex Entry:
@inproceedings{DGHKM21,
  author    = {Dallard, Clement and Ganian, Robert and Hatzel, Meike and Krnc, Matjaz and Milanic, Martin},
  title     = {Graphs with two moplexes are more than perfect},
  booktitle = {Proceedings of the 11th Latin and American Algorithms, Graphs and Optimization Symposium ({LAGOS} 2021)},
  publisher = {{Elsevier}},
  year      = {2021},
  note      = {to appear},
  keywords  = {nfpc,ParAI}  
}
Powered by bibtexbrowser