Partial triple systems and edge colourings

DOI10.1016/0012-365X(86)90117-2zbMath0656.05016MaRDI QIDQ1109776

Alan Hartman

Publication date: 1986

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

zbMATH Keywords

complete graphpartial triple systemmaximum partial triple systemminimum edge-colouringsMPTPT

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Triple systems (05B07)

Related Items (6)

Embeddings of maximum packings in triple systems ⋮ Two Doyen-Wilson theorems for maximum packings with triples ⋮ The Doyen-Wilson theorem for maximum packings of \(K_n\) with 4-cycles ⋮ On a class of completable partial edge-colourings ⋮ Embeddings of partial Steiner triple systems ⋮ The total chromatic number of regular graphs whose complement is bipartite

Cites Work

• Parallel concepts in graph theory
• One-factorizations of the complete graph—A survey
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Partial triple systems and edge colourings