A bound on the order of a graph when both the graph and its complement are contraction-critically k-connected

Yoshimi Egawa, Masao Tsugaki. A bound on the order of a graph when both the graph and its complement are contraction-critically k-connected. Australasian J. Combinatorics, 32:105-110, 2005. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.