Trigraphs (Q1124613)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Trigraphs |
scientific article |
Statements
Trigraphs (English)
0 references
1989
0 references
A tritree of a graph G is a spanning tree T of G such that every fundamental cycle of G with respect to T is a triangle. G is a trigraph if it has a tritree. Various properties of trigraphs are proved and applied to the study of cyclic double covers and path double covers two conjectures about which are shown to be equivalent for trigraphs.
0 references
tritree
0 references
spanning tree
0 references
trigraph
0 references
cyclic double covers
0 references
path double covers
0 references
