Decomposition of a complete graph into trails of given lengths

DOI10.1016/0012-365X(82)90212-6zbMath0496.05042MaRDI QIDQ1170267

S. Singh

Publication date: 1982

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

achromatic numbergraph decompositiontrails

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Euler cycles in the complete graph \(K_{2m+1}\)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on path-perfect graphs
• On the pseudoachromatic number of a graph
• The achromatic number of a graph

This page was built for publication: Decomposition of a complete graph into trails of given lengths