On the structure of complete graphs without alternating cycles

DOI10.1016/0012-365X(79)90180-8zbMath0405.05039OpenAlexW1980874723MaRDI QIDQ1257026

C. C. Chen

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1016/0012-365x(79)90180-8

zbMATH Keywords

Connected Monochromatic Spanning SubgraphEdge-Coloured Complete Graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items (1)

Complete graphs without polychromatic circuits

Cites Work

• Complete graphs without polychromatic circuits
• Graphs with Hamiltonian cycles having adjacent lines different colours
• Unnamed Item

This page was built for publication: On the structure of complete graphs without alternating cycles