Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Cycle hamiltonien")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 626

  • Page / 26
Export

Selection :

  • and

Necessary condition for Hamiltonian split graphsPEE MÖLLER, J.Discrete mathematics. 1985, Vol 54, Num 1, pp 39-47, issn 0012-365XArticle

Minimal enumerations of subsets of a finite set and the middle level problemEVDOKIMOV, A. A; PEREZHOGIN, A. L.Discrete applied mathematics. 2001, Vol 114, Num 1-3, pp 109-114, issn 0166-218XArticle

On the number of Hamiltonian cycles in triangulationsKRATOCHVIL, J; ZEPS, D.Journal of graph theory. 1988, Vol 12, Num 2, pp 191-194, issn 0364-9024Article

Hamilton cycles in Euler tour graphFU-JI ZHANG; XIAO-FONG GUO.Journal of combinatorial theory. Series B. 1986, Vol 40, Num 1, pp 1-8, issn 0095-8956Article

A survey: Hamiltonian cycles in Cayley graphsWITTE, D; GALLIAN, J. A.Discrete mathematics. 1984, Vol 51, Num 3, pp 293-304, issn 0012-365XArticle

Hamiltonian cycles in random regular graphsFENNER, T. I; FRIEZE, A. M.Journal of combinatorial theory. Series B. 1984, Vol 37, Num 2, pp 103-112, issn 0095-8956Article

On the number of Hamilton cycles in a random graphCOOPER, C; FRIEZE, A. M.Journal of graph theory. 1989, Vol 13, Num 6, pp 719-735, issn 0364-9024, 17 p.Article

Lifting Hamilton cycles of quotient graphsALSPACH, B.Discrete mathematics. 1989, Vol 78, Num 1-2, pp 25-36, issn 0012-365X, 12 p.Article

A Laplacian walk for the travelling salesmanRUJAN, P; EVERTSZ, C; LYKLEMA, J. W et al.Europhysics letters (Print). 1988, Vol 7, Num 3, pp 191-195, issn 0295-5075, 5 p.Article

Dénombrement des cycles hamiltoniens dans un rectangle quadrillé = Enumeration of Hamiltonian cycles in a rectangle made of squaresKREWERAS, G.European journal of combinatorics. 1992, Vol 13, Num 6, pp 473-476, issn 0195-6698Article

Hamiltonian cycles and paths in vertex-transitive graphs with abelian and nilpotent groupsLIPMAN, M. J.Discrete mathematics. 1985, Vol 54, Num 1, pp 15-21, issn 0012-365XArticle

Orientations of Hamiltonian cycles in large digraphsMOJDA, A. P.Journal of graph theory. 1986, Vol 10, Num 2, pp 211-218, issn 0364-9024Article

Hamiltonian cycles in cubic-3-connected bipartite planar graphsHOLTON, D. A; MANVEL, B; MCKAY, B. D et al.Journal of combinatorial theory. Series B. 1985, Vol 38, Num 3, pp 279-297, issn 0095-8956Article

A successful algorithm for the undirected Hamiltonian path problemTHOMPSON, G. L; SINGHAL, S.Discrete applied mathematics. 1985, Vol 10, Num 2, pp 179-185, issn 0166-218XArticle

The square of a Hamiltonian cycleGENGHUA FAN; HäGGKVIST, R.SIAM journal on discrete mathematics (Print). 1994, Vol 7, Num 2, pp 203-212, issn 0895-4801Article

Hamiltonian cycles in 3-connected claw-free graphsMINGCHU LI.Journal of graph theory. 1993, Vol 17, Num 3, pp 303-313, issn 0364-9024Article

Hamilton cycles and closed trails in iterated line graphsCATLIN, P. A; JANAKIRAMAN, I. T. N; SRINIVASAN, N et al.Journal of graph theory. 1990, Vol 14, Num 3, pp 347-364, issn 0364-9024Article

On the parallel complexity of Hamiltonian cycle and matching problem on dense graphsDAHLHAUS, E; HAJNAL, P; KARPINSKI, M et al.Journal of algorithms (Print). 1993, Vol 15, Num 3, pp 367-384, issn 0196-6774Article

Extending cycles in bipartite graphsHENDRY, G. R. T.Journal of combinatorial theory. Series B. 1991, Vol 51, Num 2, pp 292-313, issn 0095-8956Article

Flows in circulant graphs of odd order are sums of Hamilton cyclesLOCKE, S. C; WITTE, D.Discrete mathematics. 1989, Vol 78, Num 1-2, pp 105-114, issn 0012-365X, 10 p.Article

Compatible Hamilton decompositions of directed wrapped butterfly graphsVERRALL, H.Discrete applied mathematics. 1999, Vol 91, Num 1-3, pp 265-275, issn 0166-218XArticle

Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubesGREGOR, Petr.Discrete mathematics. 2009, Vol 309, Num 6, pp 1711-1713, issn 0012-365X, 3 p.Article

How to tile by dominoes the boundary of a polycubeBODINI, Olivier; LEFRANC, Sandrine.Lecture notes in computer science. 2006, pp 630-638, issn 0302-9743, isbn 3-540-47651-2, 1Vol, 9 p.Conference Paper

A Gray code for necklaces of fixed densityMIN YIH WANG, T; SAVAGE, C. D.SIAM journal on discrete mathematics (Print). 1996, Vol 9, Num 4, pp 654-673, issn 0895-4801Article

Théorie des Graphes: Cycles Hamiltoniens, coloration d'arêtes et problèmes de pavages = Graph Theory: Hamilton Cycles, Edge Colorings and Tiling ProblemsJurkiewicz, Samuel; Fournier, J.-C.1996, 140 p.Thesis

  • Page / 26