Decomposition of a complete graph into trails of given lengths

DOI10.1016/0012-365X(82)90212-6MaRDI QIDQ1170267zbMATH OpenFDO

Authors S. Singh

Publication date 1982

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

graph decompositionachromatic numbertrails

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3906522 (Why is no real title available?)
• scientific article; zbMATH DE number 3334007 (Why is no real title available?)
• A note on path-perfect graphs
• On the pseudoachromatic number of a graph
• The achromatic number of a graph

Cited in

(1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1170267)