Crossmark

Recognition Complexity of Subgraphs of $${\textbf {k}}$$-Connected Planar Cubic Graphs

Published Online: 2025-11-25

Published Print: 2026-02

Authors

Goetze, Miriam https://orcid.org/0000-0001-8746-522X
Jungeblut, Paul

Ueckerdt, Torsten
Funding

Funding for this research was provided by:

Karlsruher Institut für Technologie (KIT)
License Information

Text and Data Mining valid from 2025-11-25

Version of Record valid from 2025-11-25
More Information

Article History

Received: 15 October 2024

Accepted: 20 September 2025

First Online: 25 November 2025

Declarations

:

: The authors declare no Conflict of interest.

Document is current