kw.\*:("Grafo hamiltoniano")
Results 1 to 25 of 342
Selection :
Existence de cycles dans les graphes bipartis et dans plusieurs familles de graphes généralisant la classe des graphes sans K1,3 = CYCLES IN BIPARTITE GRAPHS AND SEVERAL FAMILIES THAT GENERALIZE THE CLAW-FREE GRAPHS FAMILYEl Kadi Abderrezzak, Mohamed; Flandrin, Evelyne.1999, 200 p.Thesis
NECESSARY AND SUFFICIENT CONDITIONS FOR UNIT GRAPHS TO BE HAMILTONIANMAIMANI, H. R; POURNAKI, M. R; YASSEMI, S et al.Pacific journal of mathematics. 2011, Vol 249, Num 2, pp 419-429, issn 0030-8730, 11 p.Article
Computation of the 0-dual closure for hamiltonian graphsSCHIERMEYER, I.Discrete mathematics. 1993, Vol 111, Num 1-3, pp 455-464, issn 0012-365XConference Paper
A generalization of Fan's conditions for Hamiltonicity, pancyclicity, and Hamiltonian connectednessBEDROSSIAN, P; CHEN, G; SCHELP, R. H et al.Discrete mathematics. 1993, Vol 115, Num 1-3, pp 39-50, issn 0012-365XArticle
A result about the incident edges in the graphs MkMONTENEGRO, E; SALAZAR, R.Discrete mathematics. 1993, Vol 122, Num 1-3, pp 377-380, issn 0012-365XArticle
On the Hamiltonian index of a graphLOVRECIC SARAZIN, M.Discrete mathematics. 1993, Vol 122, Num 1-3, pp 373-376, issn 0012-365XArticle
Pancyclism in hamiltonian graphsAMAR, D; FLANDRIN, E; FOURNIER, I et al.Discrete mathematics. 1991, Vol 89, Num 2, pp 111-131, issn 0012-365XArticle
Mengerian properties, hamiltonicity, and claw-free graphsFLANDRIN, E; LI, H.Networks (New York, NY). 1994, Vol 24, Num 3, pp 177-183, issn 0028-3045Article
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
Configurations and graphsGROPP, H.Discrete mathematics. 1993, Vol 111, Num 1-3, pp 269-276, issn 0012-365XConference Paper
On a problem of HendryHART, M. R; XINGXING YU.Discrete mathematics. 1992, Vol 102, Num 1, pp 107-108, issn 0012-365XArticle
Cycles containing many vertices of large degreeVELDMAN, H. J.Discrete mathematics. 1992, Vol 101, Num 1-3, pp 319-325, issn 0012-365XArticle
Generating the linear extensions of certain posets by transpositionsPRUESSE, G; RUSKEY, F.SIAM journal on discrete mathematics (Print). 1991, Vol 4, Num 3, pp 413-422, issn 0895-4801Article
Tough graphs and hamiltonian circuitsCHVATAL, V.Discrete mathematics. 2006, Vol 306, Num 10-11, pp 910-917, issn 0012-365X, 8 p.Article
The total chromatic number of graphs having large maximum degreeHILTON, A. J. W; HIND, H. R.Discrete mathematics. 1993, Vol 117, Num 1-3, pp 127-140, issn 0012-365XArticle
Applying a condition for a hamiltonian bipartite graph to be bipancyclicAMAR, D.Discrete mathematics. 1993, Vol 111, Num 1-3, pp 19-25, issn 0012-365XConference Paper
Hamiltonian properties of grid graphsZAMFIRESCU, C; ZAMFIRESCU, T.SIAM journal on discrete mathematics (Print). 1992, Vol 5, Num 4, pp 564-570, issn 0895-4801Article
The Hamiltonian property of generalized de Bruijn digraphsDU, D. Z; HSU, D. F; HWANG, F. K et al.Journal of combinatorial theory. Series B. 1991, Vol 52, Num 1, pp 1-8, issn 0095-8956Article
Hamiltonicity of 2-connected {K1,4, K1,4 + e}-free graphsRAO LI.Discrete mathematics. 2004, Vol 287, Num 1-3, pp 69-76, issn 0012-365X, 8 p.Article
Forbidden triples for hamiltonicityBROUSEK, Jan.Discrete mathematics. 2002, Vol 251, Num 1-3, pp 71-76, issn 0012-365XConference Paper
Hamiltonian graphs involving distancesCHEN, G; SCHELP, R. H.Journal of graph theory. 1992, Vol 16, Num 2, pp 121-129, issn 0364-9024Article
An improvement of Fraisse's sufficient condition for Hamiltonian graphsAINOUCHE, A.Journal of graph theory. 1992, Vol 16, Num 6, pp 529-543, issn 0364-9024Article
Hamilton-decomposable graphs and digraphs of infinite valenceWITTE, D.Discrete mathematics. 1990, Vol 84, Num 1, pp 87-100, issn 0012-365XArticle
A short proof of Fleischner's theoremGEORGAKOPOULOS, Agelos.Discrete mathematics. 2009, Vol 309, Num 23-24, pp 6632-6634, issn 0012-365X, 3 p.Article
