Two orthogonal 4-cycle-free one-factorizations of complete graphs

DOI10.1007/S00373-018-2000-YzbMath1409.05154OpenAlexW2907839811WikidataQ114229643 ScholiaQ114229643MaRDI QIDQ1741579

Jingjun Bao, Lijun Ji

Publication date: 3 May 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-018-2000-y

zbMATH Keywords

one-factorizationroom square\(C_4\)-free

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

On strong Skolem starters ⋮ A note on two orthogonal totally \(C_4\)-free one-factorizations of complete graphs ⋮ On strong Skolem starters for ℤ_pq ⋮ On \((1,C_4)\) one-factorization and two orthogonal \((2,C_4)\) one-factorizations of complete graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(k\)-cycle free one-factorizations of complete graphs
• Room designs and one-factorizations
• Sequentially perfect and uniform one-factorizations of the complete graph
• The existence of simple \(S_ 3(3,4,\nu)\)
• Anti-Ramsey colorings in several rounds
• On the structure of uniform one-factorizations from starters in finite fields
• Quintuplication of Room squares
• A multiplication theorem for Room squares
• One-factorizations of the complete graph—A survey
• Cyclotomy, Higher Congruences, and Waring's Problem
• Construction of Room Squares
• On furnishing Room squares

This page was built for publication: Two orthogonal 4-cycle-free one-factorizations of complete graphs