Trigraphs (Q1124613)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4112653
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Trigraphs |
scientific article; zbMATH DE number 4112653 |
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
0.7532719969749451
0 references
0.7465763688087463
0 references
0.7463422417640686
0 references
0.7342689037322998
0 references
0.7308200597763062
0 references
