RUS  ENG
Full version
JOURNALS // Vladikavkazskii Matematicheskii Zhurnal // Archive

Vladikavkaz. Mat. Zh., 2013 Volume 15, Number 4, Pages 48–57 (Mi vmj484)

Constructive descriptions of $n$-sequentially connected graphs

R. E. Shangin

South Ural State University, Chelyabinsk, Russia

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.

UDC: 519.863

Received: 10.12.2012



© Steklov Math. Inst. of RAS, 2025