On Unicursal Paths in a Network of Degree 4

Cited In (30)

Words with prescribed adjacencies
On encodings of spanning trees
Bounded Treewidth and Space-Efficient Linear Algebra
Spectra of uniform hypergraphs
The interlace polynomial of a graph
Complexite et circuits euleriens dans les sommes tensorielles de graphes
Enumeration of restricted three-dimensional lattice paths with fixed numbers of turns and an application
Towards a theory of patches
GTED: Graph Traversal Edit Distance
Multi-Eulerian tours of directed graphs
Robustness of the rotor-router mechanism
A characterization of circle graphs in terms of total unimodularity
The number of Euler tours of random directed graphs
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
Spectral moments of hypertrees and their applications
Simplicity in Eulerian circuits: uniqueness and safety
Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees
Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three
Graph universal cycles: compression and connections to universal cycles
Euler Digraphs
DE BRUIJN SEQUENCES REVISITED
The trace and Estrada index of uniform hypergraphs with cut vertices
Density of states of random Schrödinger operators with a uniform magnetic field
Exact goodness-of-fit tests for Markov chains
On Eulerian circuits and words with prescribed adjacency patterns
A Harary-Sachs theorem for hypergraphs
Chinese postman problem on edge-colored multigraphs

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)