On the intricacy of combinatorial construction problems
From MaRDI portal
Publication:799678
DOI10.1016/0012-365X(84)90036-0zbMATH Open0548.05013WikidataQ59233728 ScholiaQ59233728MaRDI QIDQ799678FDOQ799678
Authors: W. E. Opencomb 
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
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
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)
Cites Work
- Embedding Partial Steiner Triple Systems
- Title not available (Why is that?)
- Thank Evans!
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized latin rectangles. II: Embedding
- On the order of uniprimitive permutation groups
- A Combinatorial Theorem with an Application to Latin Rectangles
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hamiltonian decompositions of complete graphs
- Premature sets of 1-factors or how not to schedule round robin tournaments
- Title not available (Why is that?)
Cited In (7)
- Order Preserving Maps and Linear Extensions of a Finite Poset
- On the completeness of certain plane arcs
- Avoiding partial Latin squares and intricacy
- Title not available (Why is that?)
- On the intricacy of avoiding multiple-entry arrays
- The intricacy of avoiding arrays is 2
- Title not available (Why is that?)
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)
