Complete graphs without polychromatic circuits

DOI10.1016/0012-365X(83)90263-7zbMath0513.05028OpenAlexW1984387652MaRDI QIDQ1050348

N. G. Bate

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0012-365x(83)90263-7

zbMATH Keywords

monochromatic subgraphedge-colored complete graphspolychromatic circuits

Mathematics Subject Classification ID

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

Related Items (3)

Edge-coloured complete graphs: Connectedness of some subgraphs ⋮ On the structure of complete graphs without alternating cycles ⋮ Complete graphs without polychromatic circuits

Cites Work

• Unnamed Item
• Unnamed Item
• Complete graphs without polychromatic circuits
• 2-colored triangles in edge-colored complete graphs. II
• More star sub-Ramsey numbers
• On a problem of C. C. Chen and D. E. Daykin
• On the structure of complete graphs without alternating cycles

This page was built for publication: Complete graphs without polychromatic circuits