论文信息 - On a graph theorem by dirac - 字舞流文

On a graph theorem by dirac

Abstract It is shown that the maximal length c of a circuit in a graph satisfies c≧2ϱ0+1, ϱ0=minaϱ(a) except for two special classes of graphs.

Oystein Ore | O. Ore

[1] O. Ore. Note on Hamilton Circuits , 1960 .

[2] Donald J. Newman,et al. A Problem in Graph Theory , 1958 .

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

[4] G. Dirac. Some Theorems on Abstract Graphs , 1952 .

[5] P. Erdos,et al. On maximal paths and circuits of graphs , 1959 .

[6] O. Ore. Arc coverings of graphs , 1961 .