Edge-colourings of \(K_{n,n}\) with no long two-coloured cycles

DOI10.1007/S00493-008-2272-6zbMATH Open1164.05022OpenAlexW1979736093MaRDI QIDQ949803

Alan C. H. Ling, Peter Dukes

Publication date: 21 October 2008

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-008-2272-6

zbMATH Keywords

edge-colouring

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Coloring of graphs and hypergraphs (05C15)

Cites Work

• On a problem of R. Häggkvist concerning edge-colouring of bipartite graphs
• Minimal Edge-Colourings of Complete Graphs

Related Items (2)

Cycles of quadratic Latin squares and antiperfect 1‐factorisations ⋮ Linear spaces with small generated subspaces

This page was built for publication: Edge-colourings of \(K_{n,n}\) with no long two-coloured cycles

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