scientific article; zbMATH DE number 3068971

zbMath0044.38201MaRDI QIDQ5808057

T. van Aardenne-Ehrenfest, de Bruijn, N. G.

Publication date: 1951

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

zbMATH Keywords

topology

Related Items

Independently prescribable sets of n-letter words, GTED: Graph Traversal Edit Distance, A characterization of circle graphs in terms of total unimodularity, Uniform and Completely Nonequilibrium Invariant States for Weak Coupling Limit Type Quantum Markov Semigroups Associated with Eulerian Cycles, Multi-Eulerian tours of directed graphs, Hartmanis-Stearns Conjecture on Real Time and Transcendence, Universal and overlap cycles for posets, words, and juggling patterns, On algebras satisfying symmetric identities, Arborescences of covering graphs, Multicover Ucycles, Beyond the BEST theorem: fast assessment of Eulerian trails, Graph-combinatorial approach for large deviations of Markov chains, Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking, Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles, Wavelet analysis on symbolic sequences and two-fold de Bruijn sequences, Shifted de Bruijn Graphs, Nonstandard Analysis of the Behavior of Ergodic Means of Dynamical Systems on Very Big Finite Probability Spaces, New classes of perfect maps. I, Routing problems: A bibliography, The origins of combinatorics on words, An alternative formula for the number of Euler trails for a class of digraphs, De-Bruijn sequences and magic, Characterising the linear complexity of span 1 de Bruijn sequences over finite fields., Non-uniqueness of minimal superpermutations, Constant amortized time enumeration of Eulerian trails, On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials, The number of Euler tours of random directed graphs, Graph universal cycles: compression and connections to universal cycles, Sandpile groups and spanning trees of directed line graphs, Simplicity in Eulerian circuits: uniqueness and safety, The full cycles in a Young coset, The characteristic polynomials of uniform double hyperstars and uniform hypertriangles, Inferring strings from position heaps in linear time, The trace and Estrada index of uniform hypergraphs with cut vertices, Constructing the first (and coolest) fixed-content universal cycle, Comparing balanced sequences obtained from ElGamal function to random balanced sequences, Bounding the number of Eulerian tours in undirected graphs, Bounds from a card trick, Exact counting of Euler tours for generalized series-parallel graphs, Towards a theory of patches, Graphs with the unique path property: Structure, cycles, factors, and constructions, Spectra of uniform hypergraphs, Construction of de Bruijn sequences from product of two irreducible polynomials, Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three, Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs, Two-Way Non-Uniform Finite Automata, Oriented spanning trees and stationary distribution of digraphs, Refined bounds on the number of Eulerian tours in undirected graphs, A combinatorial proof of Buryak-Feigin-Nakajima, The number of quasi-trees in fans and wheels, The enumeration of directed closed Euler trails and directed Hamiltonian circuits by Lagrangian methods, Amount of nonconstructivity in deterministic finite automata, Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees, Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields, Number of cycles in the graph of 312-avoiding permutations, Shuffling biological sequences with motif constraints, The strategic value of recall, On encodings of spanning trees, Chinese postman problem on edge-colored multigraphs, Groups acting on necklaces and sandpile groups, Enumeration of restricted three-dimensional lattice paths with fixed numbers of turns and an application, On Eulerian circuits and words with prescribed adjacency patterns, The interlace polynomial of a graph, Complexite et circuits euleriens dans les sommes tensorielles de graphes, Line-digraphs, arborescences and theorems of Tutte and Knuth, Words with prescribed adjacencies, Burrows-Wheeler transformations and de Bruijn words, An efficiently generated family of binary de Bruijn sequences, Parameterized counting of partially injective homomorphisms, On cardinalities of \(k\)-abelian equivalence classes, Aneulerian digraphs and the determination of those Eulerian digraphs having an odd number of directed Eulerian paths, A simple shift rule for \(k\)-ary de Bruijn sequences, A reverse Aldous-Broder algorithm, The combinatorics of N. G. de Bruijn, Sequence graphs: characterization and counting of admissible elements, Exact distribution of word counts in shuffled sequences, On the Value of Multiple Read/Write Streams for Data Compression, A Formal Calculus for the Enumerative System of Sequences-I. Combinatorial Theorems, A Formal Calculus for the Enumerative System of Sequences-II. Applications, A Formal Calculus for the Enumerative System of Sequences-III. Further Developments, Minimum Eulerian circuits and minimum de Bruijn sequences, Exact Goodness‐of‐Fit Tests for Markov Chains, Universal cycles of \((n - 1)\)-partitions of an \(n\)-set, Alternating knot diagrams, Euler circuits and the interlace polynomial, Euler Digraphs, Miscellaneous Digraph Classes, Euler circuits and DNA sequencing by hybridization, Classical results for alternating virtual links, Hypercubes, shuffle-exchange graphs and de Bruijn digraphs, Matching, Euler tours and the Chinese postman, Maximal state complexity and generalized de Bruijn words