@article{Nebeský2007,
abstract = {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.},
author = {Nebeský, Ladislav},
journal = {Czechoslovak Mathematical Journal},
keywords = {connected chordal graph; ternary system; connected chordal graph; ternary system},
language = {eng},
number = {1},
pages = {465-471},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {A new approach to chordal graphs},
url = {http://eudml.org/doc/31142},
volume = {57},
year = {2007},
}
TY - JOUR
AU - Nebeský, Ladislav
TI - A new approach to chordal graphs
JO - Czechoslovak Mathematical Journal
PY - 2007
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 57
IS - 1
SP - 465
EP - 471
AB - 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.
LA - eng
KW - connected chordal graph; ternary system; connected chordal graph; ternary system
UR - http://eudml.org/doc/31142
ER -
