On a class of completable partial edge-colourings

DOI10.1016/0166-218X(92)90251-5zbMath0774.05040MaRDI QIDQ1186316

Alexander Rosa

Publication date: 28 June 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

commutative quasigrouppartial edge-colourings

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Loops, quasigroups (20N05) Coloring of graphs and hypergraphs (05C15) Triple systems (05B07)

Related Items (1)

Completing partial commutative quasigroups constructed from partial Steiner triple systems is NP-complete

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embedding partial Steiner triple systems is NP-complete
• Quadratic leaves of maximal partial triple systems
• Partial triple systems and edge colourings
• On the number of 1-factorizations of the complete graph
• One-factorizations of the complete graph—A survey
• Co-Ordinatizing Steiner Systems
• Minimal Edge-Colourings of Complete Graphs

This page was built for publication: On a class of completable partial edge-colourings