Page 1

Displaying 1 – 5 of 5

Showing per page

A new approach to chordal graphs

Ladislav Nebeský (2007)

Czechoslovak Mathematical Journal

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...

Currently displaying 1 – 5 of 5

Page 1