Metraipolis › archive › dc_ce3faaac9e34

Resolving Two Open Problems of Planar $B_k$-CPG Recognition: $k=0,1$ — arXiv:2610.05838

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.05838
License (as archived)
CC0-1.0
Archived
2026-10-06T16:52:16.324Z
SHA-256 of the archived text
c8b3261c0dd4d53c7912d1476da8499bdc699c62d06f9ee09392d7c886df95cd
Stable URL of this page
https://metraipolis.com/documento/dc_ce3faaac9e34

How to cite

Resolving Two Open Problems of Planar $B_k$-CPG Recognition: $k=0,1$ — arXiv:2610.05838 — arXiv (en), https://arxiv.org/abs/2610.05838 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ce3faaac9e34 (Metraipolis archive dc_ce3faaac9e34, sha256 c8b3261c0dd4d53c7912d1476da8499bdc699c62d06f9ee09392d7c886df95cd)
BibTeX
@misc{dcce3faaac9e34,
  title = {Resolving Two Open Problems of Planar $B_k$-CPG Recognition: $k=0,1$ — arXiv:2610.05838},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.05838},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ce3faaac9e34; sha256 c8b3261c0dd4d53c7912d1476da8499bdc699c62d06f9ee09392d7c886df95cd},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.05838. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A $k$-bend path is a non-self-intersecting polyline that lies on a grid and consists of at most $k+1$ axis-parallel line segments. A $B_k$-CPG graph is a graph whose vertices can be represented by pairwise interiorly disjoint $k$-bend paths on a grid such that two vertices are adjacent if and only if the corresponding grid paths touch at a grid point. We prove that recognizing planar $B_0$-CPG graphs of maximum degree 8 is NP-complete, and that recognizing planar $B_1$-CPG graphs of maximum degree 11 is NP-complete. These results settle two of the three planar recognition problems left open by Champseix, Galby, Munaro, and Ries.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.05838 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T15:19:20.008Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).