Rose, Donald J. On simple characterizations of k-trees. (English) Zbl 0285.05128 Discrete Math. 7, 317-322 (1974). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 ReviewsCited in 86 Documents MSC: 05C99 Graph theory 05C05 Trees PDFBibTeX XMLCite \textit{D. J. Rose}, Discrete Math. 7, 317--322 (1974; Zbl 0285.05128) Full Text: DOI References: [1] Harary, F., Graph Theory (1969), Addison-Wesley: Addison-Wesley Reading, Mass · Zbl 0797.05064 [2] Harary, F.; Palmer, E. M., On acyclic simplicial complexes, Mathematika, 15, 112-115 (1968) · Zbl 0157.54903 [3] Haskins, L.; Rose, D. J., Toward characterization of perfect elimination digraphs, SIAM J. Comp., 2 (1973) · Zbl 0288.05115 [4] Rose, D. J., A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations, (Read, R., Graph Theory and Computing (1972), Academic Press: Academic Press New York), 183-217 · Zbl 0266.65028 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.