Cited in
(33)- Words with prescribed adjacencies
- On encodings of spanning trees
- Spectra of uniform hypergraphs
- The interlace polynomial of a graph
- Complexite et circuits euleriens dans les sommes tensorielles de graphes
- Towards a theory of patches
- Enumeration of restricted three-dimensional lattice paths with fixed numbers of turns and an application
- Multi-Eulerian tours of directed graphs
- The number of Euler tours of random directed graphs
- GTED: Graph Traversal Edit Distance
- A characterization of circle graphs in terms of total unimodularity
- Robustness of the rotor-router mechanism
- Minimum Eulerian circuits and minimum de Bruijn sequences
- Euler circuits and DNA sequencing by hybridization
- Universal and overlap cycles for posets, words, and juggling patterns
- The full cycles in a Young coset
- Euler digraphs
- Spectral moments of hypertrees and their applications
- Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees
- Simplicity in Eulerian circuits: uniqueness and safety
- Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three
- Spectral statistics of preferred orientation quantum graphs
- Graph universal cycles: compression and connections to universal cycles
- The trace and Estrada index of uniform hypergraphs with cut vertices
- DE BRUIJN SEQUENCES REVISITED
- Density of states of random Schrödinger operators with a uniform magnetic field
- Bounded treewidth and space-efficient linear algebra
- Exact goodness-of-fit tests for Markov chains
- Universal partial tori
- On Eulerian circuits and words with prescribed adjacency patterns
- A Harary-Sachs theorem for hypergraphs
- Chinese postman problem on edge-colored multigraphs
- High-ordered spectral characterization of unicyclic graphs
This page was built for publication: On Unicursal Paths in a Network of Degree 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5779424)
