Word-Representability of Well-Partitioned Chordal Graphs
By: Tithi Dwary, K. V. Krishna
Potential Business Impact:
Makes computers understand complex word puzzles faster.
In this paper, we study the word-representability of well-partitioned chordal graphs using split decomposition. We show that every component of the minimal split decomposition of a well-partitioned chordal graph is a split graph. Thus we have a characterization for word-representability of well-partitioned chordal graphs. As a consequence, we prove that the recognition of word-representability of well-partitioned chordal graphs can be done in polynomial time. Moreover, we prove that the representation number of a word-representable well-partitioned chordal graph is at most three. Further, we obtain a minimal forbidden induced subgraph characterization of circle graphs restricted to well-partitioned chordal graphs. Accordingly, we determine the class of word-representable well-partitioned chordal graphs having representation number exactly three.
Similar Papers
Forbidden Induced Subgraph Characterization of Word-Representable Co-bipartite Graphs
Combinatorics
Helps understand special kinds of connections in networks.
Representation number of word-representable co-bipartite graph
Combinatorics
Helps computers understand special graph patterns.
Characterization of Split Comparability Graphs
Combinatorics
Helps understand how groups of things connect.