On the intricacy of combinatorial construction problems

DOI10.1016/0012-365X(84)90036-0MaRDI QIDQ799678zbMATH OpenWikidataFDO

Authors W. E. Opencomb

Publication date 1984

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

matchingcoveringHamilton cycleprojective plane1-factorizationedge-colouring

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3957110
• scientific article; zbMATH DE number 3116601
• COMPLEXITY PROBLEMS IN ENUMERATIVE COMBINATORICS
• On the algebraic structure of combinatorial problems
• A combinatorial approach to complexity
• scientific article; zbMATH DE number 3121707
• scientific article; zbMATH DE number 4213934
• scientific article; zbMATH DE number 695659

Cites work

• scientific article; zbMATH DE number 3651315 (Why is no real title available?)
• scientific article; zbMATH DE number 3654142 (Why is no real title available?)
• scientific article; zbMATH DE number 3717339 (Why is no real title available?)
• scientific article; zbMATH DE number 3737686 (Why is no real title available?)
• scientific article; zbMATH DE number 3257050 (Why is no real title available?)
• scientific article; zbMATH DE number 3059981 (Why is no real title available?)
• A Combinatorial Theorem with an Application to Latin Rectangles
• Embedding Partial Steiner Triple Systems
• Generalized latin rectangles. II: Embedding
• Hamiltonian decompositions of complete graphs
• On the order of uniprimitive permutation groups
• Premature sets of 1-factors or how not to schedule round robin tournaments
• Thank Evans!

Cited in

(7)

• scientific article; zbMATH DE number 2043350 (Why is no real title available?)
• On the completeness of certain plane arcs
• Order Preserving Maps and Linear Extensions of a Finite Poset
• Avoiding partial Latin squares and intricacy
• scientific article; zbMATH DE number 7535772 (Why is no real title available?)
• On the intricacy of avoiding multiple-entry arrays
• The intricacy of avoiding arrays is 2

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

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