On a problem of C. C. Chen and D. E. Daykin

DOI10.1016/0095-8956(78)90045-XzbMath0328.05128OpenAlexW1983651168MaRDI QIDQ1226504

D. T. Busolini

Publication date: 1977

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(78)90045-x

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Complete graphs without polychromatic circuits

Cites Work

• Graphs with Hamiltonian cycles having adjacent lines different colours

This page was built for publication: On a problem of C. C. Chen and D. E. Daykin