论文信息 - The square of every two-connected graph is Hamiltonian - 字舞流文

The square of every two-connected graph is Hamiltonian

[1] O. Ore. Theory of Graphs , 1962 .

[2] G. Dirac,et al. Minimally 2-connected graphs. , 1967 .

[3] M. Plummer. On minimal blocks , 1968 .

[4] Frank Harary,et al. Graph Theory , 2016 .

[5] Herbert Fleischner,et al. Hamiltonsche Linien im Quadrat brückenloser Graphen mit Artikulationen , 1972 .

[6] Herbert Fleischner. On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs , 1974 .