Katona, Gyula Y. and Kovács, István and Varga, Kitti Katalin (2019) The complexity of recognizing minimally tough graphs. In: Proceedings of the 11th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications. Department of Mathematical Informatics, University of Tokyo, Tokió, pp. 456-465. ISBN 9784600001599
|
Text
hj2019-kkv.pdf Download (310kB) | Preview |
| Item Type: | Book Section |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 28 Oct 2019 13:15 |
| Last Modified: | 28 Oct 2019 13:15 |
| URI: | http://real.mtak.hu/id/eprint/102689 |
Actions (login required)
![]() |
Edit Item |




