论文信息 - On the construction and enumeration of minimal blocks

On the construction and enumeration of minimal blocks

In this paper a method is given for constructing and enumerating the minimal blocks on a given number of vertices using the graphs on a smaller number of vertices. Minimal blocks having up to 12 vertices have been constructed in this way.

Ronald C. Read | Guanzhang Hu

[1] Arthur M. Hobbs. A catalog of minimal blocks , 1973 .

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

[3] R. Read. Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations , 1978 .

[4] W. Mader,et al. Surveys in Combinatorics: Connectivity and edge-connectivity in finite graphs , 1979 .

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