Metraipolis › archive › dc_dc06c2c321b3

Characterizing chordal $\llcorner$-EPG graphs via admissible clique tree orientations — arXiv:2610.09443

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.09443
License (as archived)
CC0-1.0
Archived
2026-10-08T12:43:56.054Z
SHA-256 of the archived text
646adf7ad8c955affd0661753ccf5de8efe22ac43a7c94442f5cdd7a82106dd0
Stable URL of this page
https://metraipolis.com/documento/dc_dc06c2c321b3

How to cite

Characterizing chordal $\llcorner$-EPG graphs via admissible clique tree orientations — arXiv:2610.09443 — arXiv (en), https://arxiv.org/abs/2610.09443 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dc06c2c321b3 (Metraipolis archive dc_dc06c2c321b3, sha256 646adf7ad8c955affd0661753ccf5de8efe22ac43a7c94442f5cdd7a82106dd0)
BibTeX
@misc{dcdc06c2c321b3,
  title = {Characterizing chordal $llcorner$-EPG graphs via admissible clique tree orientations — arXiv:2610.09443},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.09443},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dc06c2c321b3; sha256 646adf7ad8c955affd0661753ccf5de8efe22ac43a7c94442f5cdd7a82106dd0},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.09443. 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. An $\llcorner$-EPG graph is a graph whose vertices can be represented by 1-bend paths on a grid, where each path is either $\llcorner$, $\shortmid$, or $\text{-}$, such that two vertices are adjacent if and only if the corresponding paths share at least one grid edge. Characterizing chordal $\llcorner$-EPG graphs was explicitly posed as an open problem by Cameron, Chaplick, and Hoàng. We resolve this by giving two equivalent characterizations of connected chordal $\llcorner$-EPG graphs. The first assigns to every connected chordal $\llcorner$-EPG graph an ordered clique partition tree of its vertex set, where the underlying tree is the bipartite incidence graph of the horizontal and vertical edge-intersection components. The second is stated purely in terms of maximal cliques: a connected chordal graph is $\llcorner$-EPG if and only if some clique tree admits an admissible partial orientation. A reduction lemma replaces local clique labels by maximal cliques, linking the two characterizations. For a prescribed clique tree, the existence of an admissible partial orientation reduces to 2-SAT and is decided in $O(nM^2)$ time, where $n$ and $M$ are the numbers of vertices and maximal cliques. Finally, we show that strong chordality is not sufficient: we exhibit a strongly chordal graph that is a minimal forbidden induced subgraph for $\llcorner$-EPG, and a family of split graphs with a unique clique tree for which membership in $\llcorner$-EPG reduces to a neighborhood condition.

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.09443 — 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-08T12:17:00.183Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).