| Article ID: | iaor19921608 |
| Country: | Netherlands |
| Volume: | 36 |
| Issue: | 1 |
| Start Page Number: | 87 |
| End Page Number: | 92 |
| Publication Date: | Mar 1992 |
| Journal: | Discrete Applied Mathematics |
| Authors: | Kornai Andrs, Tuza Zsolt |
| Keywords: | graphs, combinatorial analysis |
In the syntactic theory of Tesnière the structural description of sentences are given as graphs. The authors discuss how the graph-theoretic concept of pathwidth is relevant in this approach. In particular, they point out the importance of graphs with pathwidth ¸•6 in connection with natural language processing, and give a short proof of the characterization theorem of trees with pathwidth