Complete graphs without polychromatic circuits

DOI10.1016/0012-365X(83)90263-7MaRDI QIDQ1050348zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3654142 (Why is no real title available?)
• scientific article; zbMATH DE number 3494450 (Why is no real title available?)
• 2-colored triangles in edge-colored complete graphs. II
• Complete graphs without polychromatic circuits
• 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

Cited in

(3)

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

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

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