A family of perfect factorisations of complete bipartite graphs

DOI10.1006/jcta.2001.3240zbMath1003.05081WikidataQ62638540 ScholiaQ62638540MaRDI QIDQ1601439

Darryn E. Bryant, Barbara M. Maenhaut, Ian M. Wanless

Publication date: 26 June 2002

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/817191dc116fd0b2d3e428fcfed4931ddc2c599b

zbMATH Keywords

Latin square

Mathematics Subject Classification ID

05B15: Orthogonal arrays, Latin squares, Room squares

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

d‐Regular graphs of acyclic chromatic index at least d+2, Cycles of quadratic Latin squares and antiperfect 1‐factorisations, On acyclic edge-coloring of the complete bipartite graphs \(K_{2p-1, 2p-1}\) for odd prime \(p\), On acyclic edge-coloring of complete bipartite graphs, A note on acyclic edge coloring of complete bipartite graphs, Hamiltonian double Latin squares, Semi-perfect 1-factorizations of the hypercube, A quantitative approach to perfect one-factorizations of complete bipartite graphs, New families of atomic Latin squares and perfect 1-factorisations., Cycle codes of graphs and MDS array codes, Perfect 1-Factorizations of a Family of Cayley Graphs

Cites Work

• On maximal circuits in directed graphs
• Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles
• Hamiltonian-connected self-complementary graphs
• PROPER LOOPS OF ORDER η IN WHICH EACH NON-IDENTITY ELEMENT HAS LEFT ORDER η
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item