Deciding lettericity is NP-complete, even for four-colorable comparability graphs
Vincent Vatter
Source abstract
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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.