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

DOI10.1007/S00493-004-0020-0zbMATH Open1057.05037OpenAlexW2486502620MaRDI QIDQ705747FDOQ705747

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

Recommendations

• scientific article; zbMATH DE number 3933100
• Edge-colourings of \(K_{n,n}\) with no long two-coloured cycles
• scientific article; zbMATH DE number 4099331
• On the edge colouring of bipartite graphs
• Bipartite anti-Ramsey numbers of cycles

zbMATH Keywords

Latin squaresedge-coloringHäggkvist problem

Mathematics Subject Classification ID

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

Cited In (5)

• Linear spaces with small generated subspaces
• Title not available (Why is that?)
• Title not available (Why is that?)
• Edge-colourings of \(K_{n,n}\) with no long two-coloured cycles
• Cycles of quadratic Latin squares and antiperfect 1‐factorisations

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

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