Graphs with certain families of spanning trees

P. Erdös, R. J. Faudree, C. C. Rousseau, R. H. Schelp

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

Sufficient conditions are given in terms of δ(G) and Δ(T), for a graph G with n vertices to contain a tree T with n vertices. One of these sufficient conditions is used to calculate some of the Ramsey numbers for the pair tree-star. Also necessary conditions are given, in terms of δ(G), for a graph G with n vertices to contain all trees with n vertices.

Original languageEnglish
Pages (from-to)162-170
Number of pages9
JournalJournal of Combinatorial Theory, Series B
Volume32
Issue number2
DOIs
Publication statusPublished - Apr 1982

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Graphs with certain families of spanning trees'. Together they form a unique fingerprint.

  • Cite this