On a problem of R. Häggkvist concerning edge-colouring of bipartite graphs

DOI10.1007/S00493-004-0020-0zbMath1057.05037OpenAlexW2486502620MaRDI QIDQ705747

Ján Ninčák, Peter J. Owens

Publication date: 14 February 2005

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-004-0020-0

zbMATH Keywords

Latin squaresedge-coloringHäggkvist problem

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Cycles of quadratic Latin squares and antiperfect 1‐factorisations ⋮ Edge-colourings of \(K_{n,n}\) with no long two-coloured cycles ⋮ Linear spaces with small generated subspaces

This page was built for publication: On a problem of R. Häggkvist concerning edge-colouring of bipartite graphs