On complete tripartite graphs arbitrarily decomposable into closed trails
From MaRDI portal
Recommendations
- Decomposing complete tripartite graphs into closed trails of arbitrary lengths
- Decompositions of complete multigraphs into open trails
- Decomposing complete tripartite graphs into cycles of lengths 3 and 4
- Decomposition of bipartite graphs into closed trails
- Closed trail decompositions of complete equipartite graphs
Cited in
(11)- Sparse graphs which decompose into closed trails of arbitrary lengths
- Arbitrary decompositions into open and closed trails
- On arbitrarily vertex decomposable trees
- On planar graphs arbitrarily decomposable into closed trails
- Decomposition of bipartite graphs into closed trails
- Closed trail decompositions of complete equipartite graphs
- Decomposing complete tripartite graphs into closed trails of arbitrary lengths
- Odd decompositions of Eulerian graphs
- Decompositions of complete multigraphs into open trails
- Decomposing complete equipartite graphs into closed trails of length \(k\)
- Closed trail decompositions of some classes of regular graphs
This page was built for publication: On complete tripartite graphs arbitrarily decomposable into closed trails
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5445036)
