×

Found 78 Documents (Results 1–78)

100
MathJax

Enumerating Eulerian trails via Hamiltonian path enumeration. (English) Zbl 1435.05106

Rahman, M. Sohel (ed.) et al., WALCOM: algorithms and computation. 9th international workshop, WALCOM 2015, Dhaka, Bangladesh, February 26–28, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 8973, 161-174 (2015).
PDF BibTeX XML Cite
Full Text: DOI

Fast exact algorithms for Hamiltonicity in claw-free graphs. (English) Zbl 1273.05216

Paul, Christophe (ed.) et al., Graph-theoretic concepts in computer science. 35th international workshop, WG 2009, Montpellier, France, June 24–26, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-11408-3/pbk). Lecture Notes in Computer Science 5911, 44-53 (2010).
PDF BibTeX XML Cite
Full Text: DOI

On \(s\)–\(t\) paths and trails in edge-colored graphs. (English) Zbl 1268.05112

Liebling, Thomas M. (ed.) et al., LAGOS’09 – V Latin-American algorithms, graphs, and optimization symposium. Papers from the symposium, Gramado, Brazil, November 3–7, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 35, 221-226 (2009).
MSC:  05C38 05C15 05C85
PDF BibTeX XML Cite
Full Text: DOI

Spanning trails joining two given edges. (English) Zbl 0841.05067

Alavi, Yousef (ed.) et al., Graph theory, combinatorics, and applications, Vol. 1. Proceedings of the sixth quadrennial international conference on the theory and applications of graphs held at Western Michigan University, Kalamazoo, Michigan, May 30-June 3, 1988. New York: John Wiley & Sons Ltd. Wiley-Interscience Publication. 207-222 (1991).
MSC:  05C45 05C05 05C38
PDF BibTeX XML Cite

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Year of Publication

all top 3

Classification