References
- BergeClaude, On two conjectures to generalize Vizing’s theorem Matematiche (Catania) 45 1 1990 15–23 (1991)Graphs, designs and combinatorial geometries (Catania, 1989)
- ErdősPAUL, Problems and results in graph theory and combinatorial analysis Proc. British Combinatorial Conj., 5th1975 169–192
- ErdősPál, On the combinatorial problems which i would most like to see solved Combinatorica 1 1 1981 25–42
- JensenTommy RToftBjarne, Graph Coloring Problems, Vol. 392011John Wiley & Sons
- ChangWilliam I.LawlerEugene L., Edge coloring of hypergraphs and a conjecture of Erdös, Faber, Lovász Combinatorica 8 3 1988 293–295
- KahnJeff, Coloring nearly-disjoint hypergraphs with n+o(n) colors J. Combin. Theory Ser. A 59 1 1992 31–39
- JacksonBillSethuramanG.WhiteheadCarol, A note on the Erdős-Farber-Lovász conjecture Discrete Math. 307 7–8 2007 911–915
- PaulVijiGerminaK.A., On edge coloring of hypergraphs and Erdös-Faber-Lovász conjecture Discrete Math. Algorithms Appl. 4 1 2012 12500035
- Sánchez-ArroyoAbdón, The Erdős-Faber-Lovász conjecture for dense hypergraphs Discrete Math. 308 5–6 2008 991–992
- DezaMErdösPFranklP, Intersection properties of systems of finite sets Proc. Lond. Math. Soc. 3 2 1978 369–384
- MitchemJohnSchmidtRandolph L., On the Erdős-Faber-Lovász conjecture Ars Combin. 972010 497–505
- HaddadLucienTardifClaude, A clone-theoretic formulation of the Erdös-Faber-Lovász conjecture Discuss. Math. Graph Theory 24 3 2004 545–549
- KunduSukhamaySampathkumarEShearerJamesSturtevantDean, Reconstruction of a pair of graphs from their concatenations SIAM J. Algebr. Discrete Methods 1 2 1980 228–231
- LaywineCharles FMullenGary L, Discrete Mathematics using Latin Squares, Vol. 171998Wiley New York
- YeXiaoruiXuYunqing, On the number of symmetric latin squares Computer Science and Service System (CSSS), 2011 International Conference on2011IEEE2366–2369
- BryantDarrynRodgerCA, On the completion of latin rectangles to symmetric latin squares J. Aust. Math. Soc. 76 1 2004 109–124