A family of perfect factorisations of complete bipartite graphs
DOI10.1006/JCTA.2001.3240zbMATH Open1003.05081DBLPjournals/jct/BryantMW02OpenAlexW2161669520WikidataQ62638540 ScholiaQ62638540MaRDI QIDQ1601439FDOQ1601439
Authors: Darryn Bryant, Barbara 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
Recommendations
- Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles
- New families of atomic Latin squares and perfect 1-factorisations.
- On perfect one-factorization of the complete graph \(K_{2p}\)
- A quantitative approach to perfect one-factorizations of complete bipartite graphs
- scientific article; zbMATH DE number 4043852
Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- On maximal circuits in directed graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hamiltonian-connected self-complementary graphs
- PROPER LOOPS OF ORDER η IN WHICH EACH NON-IDENTITY ELEMENT HAS LEFT ORDER η
- Title not available (Why is that?)
Cited In (21)
- Title not available (Why is that?)
- Row‐Hamiltonian Latin squares and Falconer varieties
- Semi-perfect 1-factorizations of the hypercube
- A quantitative approach to perfect one-factorizations of complete bipartite graphs
- A note on acyclic edge coloring of complete bipartite graphs
- Perfect 1-Factorizations of a Family of Cayley Graphs
- Title not available (Why is that?)
- On acyclic edge-coloring of complete bipartite graphs
- Atomic Latin squares based on cyclotomic orthomorphisms
- New families of atomic Latin squares and perfect 1-factorisations.
- Title not available (Why is that?)
- Family sizes for complete multipartite graphs
- d‐Regular graphs of acyclic chromatic index at least d+2
- On the perfect 1-factorisation problem for circulant graphs of degree 4
- Cycle codes of graphs and MDS array codes
- On acyclic edge-coloring of the complete bipartite graphs \(K_{2p-1, 2p-1}\) for odd prime \(p\)
- On perfect one-factorization of the complete graph \(K_{2p}\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hamiltonian double Latin squares
- Cycles of quadratic Latin squares and antiperfect 1‐factorisations
This page was built for publication: A family of perfect factorisations of complete bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1601439)
