×

A characterisation of rigid circuit graphs. (English) Zbl 0288.05128


MSC:

05C99 Graph theory
05C05 Trees
Full Text: DOI

References:

[1] Berge, C., (Proc. Colloq. held at Halle, March 1960. Proc. Colloq. held at Halle, March 1960, Farbung von Graphen, deren sanlichte bzw. deren ungerade Kreise starr sind. Beitra˜ge zur Graphentheorie, 10 (1961), Wiss. Z. Univ. Halle), 114
[2] Buneman, O. P., The recovery of trees from measures of dissimilarity, (Mathematics in the Archaeological and Historical Sciences (1972), Edinburgh Univ. Press: Edinburgh Univ. Press Edinburgh), 387
[3] Dirac, G. A., On rigid circuit graphs, (Abh. Math. Sem., 25 (1974), Univ. Hamburg), 71 · Zbl 0098.14703
[4] Fulkerson, D. R.; Gross, O. A., Incidence matrices and internal graphs, Pacific J. Math., 15, 3, 835 (1965) · Zbl 0132.21001
[5] Hajnal, A.; Surányi, J., Über die Ausflosung von Graphen in vollständrge Teilgraphen, Ann. Univ. Sci. Budapest. Eotvos, Sect. Math., 1, 113 (1958) · Zbl 0093.37801
[6] Harray, F., A graph-theoretic approach to similarity relations, Psychometrica, 29, 2 (June 1964) · Zbl 0132.40502
[7] Roberts, P. S., Indifference graphs, (Harary, F., Proof Techniques in Graph Theory (1969), Academic Press: Academic Press New York), 139 · Zbl 0193.24205
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.