On the intricacy of combinatorial construction problems

DOI10.1016/0012-365X(84)90036-0zbMath0548.05013WikidataQ59233728 ScholiaQ59233728MaRDI QIDQ799678

W. E. Opencomb

Publication date: 1984

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

zbMATH Keywords

coveringmatchingprojective planeedge-colouring1-factorizationHamilton cycle

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Orthogonal arrays, Latin squares, Room squares (05B15) Eulerian and Hamiltonian graphs (05C45) Designs and configurations (05Bxx)

Related Items (6)

The intricacy of avoiding arrays is 2 ⋮ On the completeness of certain plane arcs ⋮ Avoiding partial Latin squares and intricacy ⋮ Unnamed Item ⋮ On the intricacy of avoiding multiple-entry arrays ⋮ Order Preserving Maps and Linear Extensions of a Finite Poset

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian decompositions of complete graphs
• Premature sets of 1-factors or how not to schedule round robin tournaments
• Generalized latin rectangles. II: Embedding
• On the order of uniprimitive permutation groups
• Thank Evans!
• Embedding Partial Steiner Triple Systems
• A Combinatorial Theorem with an Application to Latin Rectangles

This page was built for publication: On the intricacy of combinatorial construction problems