Edge-colourings of K_n,n with no long two-coloured cycles

DOI10.1007/S00493-008-2272-6MaRDI QIDQ949803zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 3933100
• On a problem of R. Häggkvist concerning edge-colouring of bipartite graphs
• Edge Colorings of K(m,n) with m+n-1 Colors Which Forbid Rainbow Cycles
• scientific article; zbMATH DE number 1067836
• Edge-colorings of \(K_{m,n}\) which forbid multicolored cycles

Cites work

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

Cited in

(5)

• Linear spaces with small generated subspaces
• scientific article; zbMATH DE number 4099331 (Why is no real title available?)
• Cycles of quadratic Latin squares and antiperfect 1‐factorisations
• Small antiperfect Steiner triple systems
• On a problem of R. Häggkvist concerning edge-colouring of bipartite graphs

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)