Edge-coloured complete graphs: Connectedness of some subgraphs

DOI10.1016/0012-365X(87)90124-5zbMath0673.05034OpenAlexW1967508792MaRDI QIDQ1120587

Marcin Malawski, Jan Komar, Adam Idzik

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0012-365x(87)90124-5

zbMATH Keywords

edge colouringmonochromatic separating edge set

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Complete graphs without polychromatic circuits
• Parallel concepts in graph theory

This page was built for publication: Edge-coloured complete graphs: Connectedness of some subgraphs