Q4318151 (Q4318151): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 10:06, 23 May 2024

scientific article; zbMATH DE number 706769

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 706769

Statements

scholarly article

0 references

publication date

3 April 1995

0 references

full work available at URL

https://eudml.org/doc/31858

0 references

zbMATH Keywords

permutations

0 references

Hamiltonian cycle

0 references

Hamiltonian paths

0 references

Gray codes

0 references

labellings

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

Efficient generation of the binary reflected gray code and its applications

0 references

Gray codes with restricted density

0 references

Transposition Graphs

0 references

Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

0 references

Stable and semi-stable unicyclic graphs

0 references

Generating Binary Trees Lexicographically

0 references

Generation of Permutations by Adjacent Transposition

0 references

Gray codes in graphs of subsets

0 references

Combinatorial Gray Codes

0 references

Binary tree gray codes

0 references

0 references

Adjacent interchange generation of combinations

0 references

Gray code sequences of partitions

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4318151

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4318151&oldid=34136700"