Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{gutin_et_al:LIPIcs.MFCS.2021.54, author = {Gutin, Gregory and Yeo, Anders}, title = {{Perfect Forests in Graphs and Their Extensions}}, booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)}, pages = {54:154:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772013}, ISSN = {18688969}, year = {2021}, volume = {202}, editor = {Bonchi, Filippo and Puglisi, Simon J.}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14494}, URN = {urn:nbn:de:0030drops144947}, doi = {10.4230/LIPIcs.MFCS.2021.54}, annote = {Keywords: graphs, odd degree subgraphs, perfect forests, polynomial algorithms} }
Keywords:  graphs, odd degree subgraphs, perfect forests, polynomial algorithms  
Collection:  46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)  
Issue Date:  2021  
Date of publication:  18.08.2021 