Lower Bound for Independence Covering in C₄-Free Graphs

From MaRDI portal
Lower Bound for Independence Covering in $C 4$-Free Graphs

MaRDI QIDQ6449137zbMATH OpenFDO

Authors Michael A. Kuhn, Daniel Lokshtanov, Zachary A. Miller

Publication date 29 August 2023


Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)
















This page was built for publication: Lower Bound for Independence Covering in $C_4$-Free Graphs

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Lower_Bound_for_Independence_Covering_in_$C_4$-Free_Graphs&oldid=95256467"
Powered by MediaWiki