"Broersma"@fr . "19"^^ . "B."@fr . "Graphs & Digraphs"@fr . . "1929"^^ . "Hochbaum"@fr . "Montreal"@fr . . "Ping Zhang"@fr . "Lesniak"@fr . "325458"^^ . . "416980"^^ . "Kapoor"@fr . "R. Garey"@fr . "Journal of Combinatorial Theory B"@fr . . "A short proof of Fleischner's theorem"@fr . "6"^^ . "2558627"^^ . . "V\u00E1clav"@fr . "2"^^ . "3"^^ . "Diestel"@fr . "Shmoys"@fr . "Fleischner"@fr . "1"^^ . "Stanislav"@fr . "Elsevier"@fr . "Underground"@fr . . "C. St. J. A."@fr . "H. T."@fr . "29"^^ . "Tough graphs and Hamiltonian circuits"@fr . . "puissance d'un graphe"@fr . "Janina"@fr . "S. F."@fr . "10.1137"^^ . . "345865"^^ . . "Dorit S. Hochbaum"@fr . "Carsten Thomassen"@fr . "Georgakopoulos"@fr . "1743840"^^ . "In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts"@fr . "Parker"@fr . . "Monatshefte f\u00FCr Mathematik"@fr . "220"^^ . . . . . "Nash-Williams"@fr . "Reinhard"@fr . "3"^^ . "Annals of Discrete Mathematics"@fr . . "1373656"^^ . "316301"^^ . "1"^^ . "10.1016"^^ . "Veldman"@fr . "427135"^^ . "Guaranteed performance heuristics for the bottleneck traveling salesman problem"@fr . "Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms"@fr . "A new proof of the theorem by Fleischner"@fr . . "M\u00FCttel"@fr . "269"^^ . "CRC Press"@fr . "Crispin Nash-Williams"@fr . "Graph power"@fr . . "Not every 2-tough graph is Hamiltonian"@fr . "Gary Chartrand"@fr . . "Advances in Mathematics"@fr . "13908237"^^ . . "317"^^ . "Amsterdam"@fr . "Eva"@fr . . "978"^^ . . . "Finding a Hamiltonian cycle in the square of a block."@fr . . "McGill University"@fr . "10.1145"^^ . "The square of a block is Hamiltonian connected"@fr . "David B."@fr . . "Rautenbach"@fr . "Zhang"@fr . "Handbook of combinatorics, Vol. 1, 2"@fr . "Bauer"@fr . "ACM"@fr . . "J. A."@fr . "Lau"@fr . "6632"^^ . . "1986"^^ . . "290"^^ . "Proceedings of the Second Louisiana Conference on Combinatorics, Graph Theory and Computing"@fr . "9781439826270"^^ . "323"^^ . . . "V\u00E1clav Chv\u00E1tal"@fr . "Ph.D. thesis"@fr . . "125"^^ . "Chartrand"@fr . . . "670"^^ . "Polly"@fr . "2483226"^^ . "117"^^ . "Jung"@fr . "Dorit S."@fr . . . "Basic graph theory: paths and circuits"@fr . . "Louisiana State University"@fr . "2018"^^ . "A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time"@fr . "Carsten"@fr . "Hamiltonian paths in squares of infinite locally finite blocks"@fr . "Operations Research Letters"@fr . . . . "Stephen"@fr . . "Advances in Graph Theory"@fr . "carr\u00E9"@fr . "Journal of the ACM"@fr . . "522906"^^ . "Discrete Applied Mathematics"@fr . "Bondy"@fr . "A short proof of the versatile version of Fleischner's theorem"@fr . . . "Rotenberg"@fr . "1991"^^ . "Herbert"@fr . . "99"^^ . "1984"^^ . . "1995"^^ . "Ping"@fr . "Agelos"@fr . . "309"^^ . "82"^^ . "1645"^^ . "2000"^^ . "Bollob\u00E1s"@fr . "Dieter"@fr . "2012"^^ . "Chv\u00E1tal"@fr . "2010"^^ . . "2009"^^ . "313"^^ . "10"^^ . "On graphs with Hamiltonian squares"@fr . . "139"^^ . "Arthur M."@fr . "B\u00E9la Bollob\u00E1s"@fr . "Pancyclic graphs"@fr . "52"^^ . "13929"^^ . "1974"^^ . "10.1007"^^ . "David Shmoys"@fr . . "1973"^^ . "En th\u00E9orie des graphes, le th\u00E9or\u00E8me de Fleischner donne une condition suffisante pour qu'un graphe contienne un cycle hamiltonien. Il dit que le (en) d'un graphe biconnexe est un graphe hamiltonien. Le th\u00E9or\u00E8me porte le nom de Herbert Fleischner, qui en a publi\u00E9 la preuve en 1974."@fr . "Hobbs"@fr . "Series B"@fr . "1971"^^ . "G."@fr . "179782305"^^ . "Ronald L."@fr . "4"^^ . "5"^^ . "1109427"^^ . "1980"^^ . "Infinite Hamilton cycles in squares of locally finite graphs"@fr . "Th\u00E9or\u00E8me de Fleischner"@fr . "1978"^^ . "1976"^^ . "New York, NY, USA"@fr . "33"^^ . "Baton Rouge, Louisiana"@fr . "167"^^ . "Rardin"@fr . "Linda"@fr . "\u0158\u00EDha"@fr . "En th\u00E9orie des graphes, le th\u00E9or\u00E8me de Fleischner donne une condition suffisante pour qu'un graphe contienne un cycle hamiltonien. Il dit que le (en) d'un graphe biconnexe est un graphe hamiltonien. Le th\u00E9or\u00E8me porte le nom de Herbert Fleischner, qui en a publi\u00E9 la preuve en 1974."@fr . . "Gary"@fr . "20"^^ . "Thomassen"@fr . "21"^^ . "Alstrup"@fr . "16"^^ . "John Adrian Bondy"@fr . "H. A."@fr . "215"^^ . "Arthur Hobbs"@fr . . "499125"^^ . . "A unified approach to approximation algorithms for bottleneck problems"@fr . "D."@fr . . . . "The square of a block is vertex pancyclic"@fr . "533"^^ . "5"^^ . "Proceedings of the 5th Twente Workshop on Graphs and Combinatorial Optimization"@fr . "332573"^^ . "2"^^ . "3"^^ . . "H. J."@fr . "The square of every two-connected graph is Hamiltonian"@fr . "23"^^ . . . "Graph Theory"@fr . .