A new approach to chordal graphs
Czechoslovak Mathematical Journal, Tome 57 (2007) no. 1, pp. 465-471
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
By a chordal graph is meant a graph with no induced cycle of length $\ge 4$. By a ternary system is meant an ordered pair $(W, T)$, where $W$ is a finite nonempty set, and $T \subseteq W \times W \times 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.
By a chordal graph is meant a graph with no induced cycle of length $\ge 4$. By a ternary system is meant an ordered pair $(W, T)$, where $W$ is a finite nonempty set, and $T \subseteq W \times W \times 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.
@article{CMJ_2007_57_1_a34,
author = {Nebesk\'y, Ladislav},
title = {A new approach to chordal graphs},
journal = {Czechoslovak Mathematical Journal},
pages = {465--471},
year = {2007},
volume = {57},
number = {1},
mrnumber = {2309978},
zbl = {1174.05110},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CMJ_2007_57_1_a34/}
}
Nebeský, Ladislav. A new approach to chordal graphs. Czechoslovak Mathematical Journal, Tome 57 (2007) no. 1, pp. 465-471. http://geodesic.mathdoc.fr/item/CMJ_2007_57_1_a34/