A new approach to chordal graphs |
| |
Authors: | Ladislav Nebeský |
| |
Affiliation: | (1) Filozofická fakulta, Univerzita Karlova v Praze, nám. J. Palacha 2, 116 38 Praha 1, Czech Republic |
| |
Abstract: | By a chordal graph is meant a graph with no induced cycle of length ⩾ 4. By a ternary system is meant an ordered pair (W, T), where W is a finite nonempty set, and T ⊆ W × W × W. Ternary systems satisfying certain axioms (A1)–(A5) are studied in this paper; note that these axioms can be formulated in a language of the first-order logic. For every finite nonempty set W, a bijective mapping from the set of all connected chordal graphs G with V(G) = W onto the set of all ternary systems (W, T) satisfying the axioms (A1)–(A5) is found in this paper. |
| |
Keywords: | connected chordal graph ternary system |
本文献已被 SpringerLink 等数据库收录! |
|