1. Almost all Graphs with 1.44n Edges Are 3-Colourable
:CHVÁTAL, V. Almost all Graphs with 1.44n Edges Are 3-Colourable. 1. ed. Bonn : Inst. für Operations Research, 1989. 19 s. Report, No.89602-OR. [Copy count : 1, currently available 1, at library only 0]