One-factorizations of regular graphs of order 12

MaRDI QIDQ1773192zbMATH OpenFDO

Authors Petteri Kaski, Patric R. J. Östergård

Publication date 25 April 2005

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/124599, http://www.emis.de/journals/EJC/Volume_12/Abstracts/v12i1r2.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

algorithmstriple system

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Recommendations

• On the Enumeration of One-Factorizations of Complete Graphs Containing Prescribed Automorphism Groups
• scientific article; zbMATH DE number 979131
• 1‐Factorizations of pseudorandom graphs
• One-factorizations of complete graphs with vertex-regular automorphism groups
• There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK₁₄

Cited in

(4)

• Steiner triple systems of order 21 with subsystems
• Enumeration of Steiner triple systems with subsystems
• scientific article; zbMATH DE number 3981179 (Why is no real title available?)
• Steiner triple systems satisfying the 4-vertex condition

Describes a project that uses

Uses Software

• nauty

This page was built for publication: One-factorizations of regular graphs of order 12

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