On 2-connected graphs avoiding cycles of length 0 modulo 4

From MaRDI portal
On $2$-connected graphs avoiding cycles of length $0$ modulo $4$

MaRDI QIDQ7185343arXivFDO

Authors Hojin Chu, Boram Park, Homoon Ryu

Publication date 2025

Published in arXiv


arXiv classification

math.CO















This page was built for publication: On $2$-connected graphs avoiding cycles of length $0$ modulo $4$

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=On_$2$-connected_graphs_avoiding_cycles_of_length_$0$_modulo_$4$&oldid=107415239"
Powered by MediaWiki