Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Graphe 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 552

  • Page / 23
Export

Selection :

  • and

Hamiltonian results in K1,3-free graphsMATTHEWS, M. M; SUMNER, D. P.Journal of graph theory. 1984, Vol 8, Num 1, pp 139-146, issn 0364-9024Article

Hamiltonicity in (0-1)-polyhedraNADDEF, D. J; PULLEYBLANK, W. R.Journal of combinatorial theory. Series B. 1984, Vol 37, Num 1, pp 41-52, issn 0095-8956Article

Hamiltonian path graphsCHARTRAND, G; KAPOOR, S. F; NORDHAUS, E. A et al.Journal of graph theory. 1983, Vol 7, Num 4, pp 419-427, issn 0364-9024Article

How many random eges make a graph Hamiltonian?ELI SHAMIR.Combinatorica (Print). 1983, Vol 3, Num 1, pp 123-131, issn 0209-9683Article

Are all simple 4-polytopes hamiltonian?ROSENFELD, M.Israel Journal of Mathematics. 1983, Vol 46, Num 3, pp 161-169, issn 0021-2172Article

One Hamiltonian line graphsCLARK, L.Journal of graph theory. 1984, Vol 8, Num 2, pp 303-307, issn 0364-9024Article

New sufficient conditions for cycles in graphsGENG-HUA FAN.Journal of combinatorial theory. Series B. 1984, Vol 37, Num 3, pp 221-227, issn 0095-8956Article

Hamiltonian pancyclic graphsAMAR, D; FLANDRIN, E; FOURNIER, I et al.Discrete mathematics. 1983, Vol 46, Num 3, issn 0012-365X, 327Article

Hamiltonian uniform subset graphsBOR-LIANG CHEN; KO-WEI LIH.Journal of combinatorial theory. Series B. 1987, Vol 42, Num 3, pp 257-263, issn 0095-8956Article

Forbidden subgraphs and Hamiltonian properties in the square of a connected graphGOULD, R. J; JACOBSON, M. S.Journal of graph theory. 1984, Vol 8, Num 1, pp 147-154, issn 0364-9024Article

Hamiltonian cycles in striped graphs: the two-stripe problemGARFINKEL, R. S; SUNDARARAGHAVAN, P. S.SIAM journal on algebraic and discrete methods. 1984, Vol 5, Num 4, pp 463-466, issn 0196-5212Article

On the notion of infinite hamiltonian graphHALIN, R.Journal of graph theory. 1983, Vol 7, Num 4, pp 437-440, issn 0364-9024Article

The classification of hamiltonian generalized petersen graphsALSPACH, B.Journal of combinatorial theory. Series B. 1983, Vol 34, Num 3, pp 293-312, issn 0095-8956Article

Graphs uniquely Hamiltonian-connected from a vertexHENDRY, G. R. T.Discrete mathematics. 1984, Vol 49, Num 1, pp 61-74, issn 0012-365XArticle

Hamiltonian decompositions of complete graphsHILTON, A. J. W.Journal of combinatorial theory. Series B. 1984, Vol 36, Num 2, pp 125-134, issn 0095-8956Article

A generalization of a result of Häggkvist and NicoghossianBAUER, D; BROERSMA, H. J; VELDMAN, H. J et al.Journal of combinatorial theory. Series B. 1989, Vol 47, Num 2, pp 237-243, issn 0095-8956, 7 p.Article

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

A sufficient condition for oriented graphs to be HamiltonianFAVARON, O; ORDAZ, O.Discrete mathematics. 1986, Vol 58, Num 3, pp 243-252, issn 0012-365XArticle

The square of a connected S(K1,3)-free graph is vertex pancyclicHENDRY, G; VOGLER, W.Journal of graph theory. 1985, Vol 9, Num 4, pp 535-537, issn 0364-9024Article

Minimum k-Hamiltonian graphsWONG, W. W; WONG, C. K.Journal of graph theory. 1984, Vol 8, Num 1, pp 155-165, issn 0364-9024Article

Powers of connected graphs and hamiltonicityPAOLI, M.Discrete mathematics. 1984, Vol 52, Num 1, pp 91-99, issn 0012-365XArticle

On hamiltonian-connected regular graphsTOMESCU, I.Journal of graph theory. 1983, Vol 7, Num 4, pp 429-436, issn 0364-9024Article

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

Digraphs and bigraphs relationship between strong connectedness and strong α-connectedness α-Hamiltonian digraphsGRIECO, M; ZUCCHETTI, B.Rendiconti - Istituto lombardo. Accademia di scienze e lettere. A. Scienze matematiche e applicazioni. 1983, Vol 117, pp 253-263, issn 0392-9523Article

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

  • Page / 23