Metraipolis › archive › dc_afd039de786a
Deciding lettericity is NP-complete, even for four-colorable comparability graphs — arXiv:2610.06482
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.06482
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T16:52:39.456Z
- SHA-256 of the archived text
c246376345fc49e1218fc4ec2346a4b643cbdb9012c0bb3065f36fdac5dafb88- Stable URL of this page
https://metraipolis.com/documento/dc_afd039de786a
How to cite
Deciding lettericity is NP-complete, even for four-colorable comparability graphs — arXiv:2610.06482 — arXiv (en), https://arxiv.org/abs/2610.06482 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_afd039de786a (Metraipolis archive dc_afd039de786a, sha256 c246376345fc49e1218fc4ec2346a4b643cbdb9012c0bb3065f36fdac5dafb88)
BibTeX
@misc{dcafd039de786a,
title = {Deciding lettericity is NP-complete, even for four-colorable comparability graphs — arXiv:2610.06482},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.06482},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_afd039de786a; sha256 c246376345fc49e1218fc4ec2346a4b643cbdb9012c0bb3065f36fdac5dafb88},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.06482. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We prove that deciding whether a graph has lettericity at most k is NP-complete, even for four-colorable comparability graphs. Our reduction maps a bipartite graph G to the graph obtained from its incidence graph by inflating each vertex by a clique or an independent set of three vertices. The lettericity of this graph is determined by the numbers of vertices and edges of G and the greatest number of edge-disjoint paths on four vertices in G. Teypaz and Rapine showed that deciding whether the edges of a bipartite graph can be partitioned into paths on four vertices is NP-complete. 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.06482 — 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.029Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).