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.
Recommendations
Cites work
- Cycle double covers of graphs with Hamilton paths
- Cycles in weighted graphs
- Flows and generalized coloring theorems in graphs
- scientific article; zbMATH DE number 4214053 (Why is no real title available?)
- scientific article; zbMATH DE number 3728302 (Why is no real title available?)
- scientific article; zbMATH DE number 3253072 (Why is no real title available?)
- Perfect path double covers of graphs
- Semi-duality and the cycle double cover conjecture
Cited in
(9)- Cycles in weighted graphs
- Triple dots in a formal language
- Tree spanners of bounded degree graphs
- Optimality computation of the minimum stretch spanning tree problem
- On approximating tree spanners that are breadth first search trees
- Translating Tridents
- Independent tree spanners: Fault-tolerant spanning trees with constant distance guarantees
- Some results on double triangle descendants of \(K_5\)
- Eulerian colorings and the bipartizing matchings conjecture of Fleischner
This page was built for publication: Trigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124613)
