"Recognition Complexity of Subgraphs of bf k-Connected Planar Cubic Graphs."

Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt (2026)

> Home

Details and statistics

DOI: 10.1007/S00453-025-01350-8

access: closed

type: Journal Article

metadata version: 2025-12-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/GoetzeJU26
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/GoetzeJU26
Miriam Goetze, Paul Jungeblut, Torsten Ueckerdt:
Recognition Complexity of Subgraphs of bf k-Connected Planar Cubic Graphs. Algorithmica 88(1): 11 (2026)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.