scientific article; zbMATH DE number 3407692

zbMath0258.05101MaRDI QIDQ5672651

Shimon Even

Publication date: 1973

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Algorithms in computer science (68W99) Graph theory (05Cxx) Software, source code, etc. for problems pertaining to combinatorics (05-04) Enumerative combinatorics (05Axx)

Related Items (19)

An algorithm for generating shift-register cycles ⋮ The use and usefulness of numeration systems ⋮ A loop-free algorithm for generating the linear extensions of a poset ⋮ Best Huffman trees ⋮ Complexity of finding k-path-free dominating sets in graphs ⋮ How to guard a graph? ⋮ Comparability graphs and intersection graphs ⋮ Forming partnerships in a virtual factory ⋮ Two elementary commutativity theorems for rings ⋮ A simple systolic algorithm for generating combinations in lexicographic order ⋮ Colouring Steiner quadruple systems ⋮ An application of Ramsey's theory to partitions in groups. I ⋮ A Gray code for set partitions ⋮ Syntactic view of sigma-tau generation of permutations ⋮ Unnamed Item ⋮ On testing isomorphism of permutation graphs ⋮ Service chain placement in SDNs ⋮ Cayley permutations ⋮ An algorithm for generating subsets of fixed size with a strong minimal change property

This page was built for publication: