On the complexity of finding a spanning even tree in a graph

MaRDI QIDQ6759467arXivFDO

Authors Tesshu Hanaka, Yasuaki Kobayashi, Kazuhiro Kurita, Yasuko Matsui, Atsuki Nagao, Hirotaka Ono, Kazuhisa Seto

Publication date 2024

Published in arXiv

arXiv classification

cs.DS

This page was built for publication: On the complexity of finding a spanning even tree in a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6759467)