Abstract:
The class of nonoriented $n$-sequentially connected graphs is introduced and some applications are considered. The main characteristics and properties of $n$-sequentially connected chains are given. The relations of the class of $n$-sequentially connected chains to perfect, triangulated, composite and splittable classes of graphs are determined.
Key words:$n$-sequentially connected graph, treewidth of a graph, triangulated graph, dynamic programming, Weber problem, quadratic assignment problem.