Cargando…
Covering walks in graphs
Covering Walks in Graphs is aimed at researchers and graduate students in the graph theory community and provides a comprehensive treatment on measures of two well studied graphical properties, namely Hamiltonicity and traversability in graphs. This text looks into the famous Kӧnigsberg Bridge Prob...
Autores principales: | Fujie, Futaba, Zhang, Ping |
---|---|
Lenguaje: | eng |
Publicado: |
Springer
2014
|
Materias: | |
Acceso en línea: | https://dx.doi.org/10.1007/978-1-4939-0305-4 http://cds.cern.ch/record/1646880 |
Ejemplares similares
-
Circuit double cover of graphs
por: Zhang, Cun-Quan
Publicado: (2012) -
Groups, graphs and random walks
por: Ceccherini-Silberstein, Tullio, et al.
Publicado: (2017) -
Transfiniteness: for graphs, electrical networks, and random walks
por: Zemanian, Armen H
Publicado: (1996) -
A walk through combinatorics: an introduction to enumeration and graph theory
por: Bóna, Miklós
Publicado: (2008) -
The language of self-avoiding walks: connective constants of quasi-transitive graphs
por: Lindorfer, Christian
Publicado: (2019)