On Unicursal Paths in a Network of Degree 4

DOI10.2307/2302716zbMath0025.09103OpenAlexW4236189701WikidataQ56504661 ScholiaQ56504661MaRDI QIDQ5779424

Cedric A. B. Smith, William T. Tutte

Publication date: 1941

Full work available at URL: https://doi.org/10.2307/2302716

zbMATH Keywords

Topology

Related Items (30)

GTED: Graph Traversal Edit Distance ⋮ A characterization of circle graphs in terms of total unimodularity ⋮ Multi-Eulerian tours of directed graphs ⋮ Spectral moments of hypertrees and their applications ⋮ Universal and overlap cycles for posets, words, and juggling patterns ⋮ Robustness of the rotor-router mechanism ⋮ Bounded Treewidth and Space-Efficient Linear Algebra ⋮ The number of Euler tours of random directed graphs ⋮ Graph universal cycles: compression and connections to universal cycles ⋮ Simplicity in Eulerian circuits: uniqueness and safety ⋮ The full cycles in a Young coset ⋮ The trace and Estrada index of uniform hypergraphs with cut vertices ⋮ Towards a theory of patches ⋮ Spectra of uniform hypergraphs ⋮ Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three ⋮ Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees ⋮ On encodings of spanning trees ⋮ Density of states of random Schrödinger operators with a uniform magnetic field ⋮ Chinese postman problem on edge-colored multigraphs ⋮ DE BRUIJN SEQUENCES REVISITED ⋮ 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 ⋮ Words with prescribed adjacencies ⋮ A Harary-Sachs theorem for hypergraphs ⋮ Minimum Eulerian circuits and minimum de Bruijn sequences ⋮ Exact Goodness‐of‐Fit Tests for Markov Chains ⋮ Euler Digraphs ⋮ Euler circuits and DNA sequencing by hybridization

This page was built for publication: On Unicursal Paths in a Network of Degree 4