Recognition Complexity of Subgraphs of 2- and 3-Connected Planar Cubic Graphs

From MaRDI portal

Jump to:navigation, search

MaRDI QIDQ6516988arXivFDO

Authors Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt

Published in arXiv

This page was built for publication: Recognition Complexity of Subgraphs of 2- and 3-Connected Planar Cubic Graphs

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Recognition_Complexity_of_Subgraphs_of_2-_and_3-Connected_Planar_Cubic_Graphs&oldid=103489490"