×

Found 3 Documents (Results 1–3)

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).
PDFBibTeX XMLCite
Full Text: DOI

Some problems related to Hamiltonian line graphs. (English) Zbl 1408.05079

Chen, Zhijie (ed.) et al., Proceedings of the international conference on complex geometry and related fields, Shanghai, China, 2004. Providence, RI: American Mathematical Society (AMS); Somerville, MA: International Press. AMS/IP Stud. Adv. Math. 39, 149-159 (2007).
MSC:  05C45 05C38 05C76
PDFBibTeX XMLCite

Every 3-connected, essentially 11-connected line graph is Hamiltonian. (English) Zbl 1192.05129

Felsner, Stefan (ed.), 2005 European conference on combinatorics, graph theory and applications (EuroComb ’05). Extended abstracts from the conference, Technische Universität Berlin, Berlin, Germany, September 5–9, 2005. Paris: Maison de l’Informatique et des Mathématiques Discrètes (MIMD). Discrete Mathematics & Theoretical Computer Science. Proceedings. AE, 379-382, electronic only (2005).
MSC:  05C76 05C45
PDFBibTeX XMLCite
Full Text: Link

Filter Results by …

Year of Publication

Main Field