×

zbMATH — the first resource for mathematics

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

MSC:
05C99 Graph theory
05C05 Trees
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Berge, C., (), 114
[2] Buneman, O.P., The recovery of trees from measures of dissimilarity, (), 387
[3] Dirac, G.A., On rigid circuit graphs, (), 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)
[7] Roberts, P.S., Indifference graphs, (), 139
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.