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 number; graph decomposition; trails

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C15: Coloring of graphs and hypergraphs

05C45: Eulerian and Hamiltonian graphs

Related Items

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