Graphs with certain families of spanning trees

DOI10.1016/0095-8956(82)90032-6zbMATH Open0465.05058OpenAlexW2134945404MaRDI QIDQ1154485FDOQ1154485

Authors: Ralph Faudree, Cecil Rousseau, R. H. Schelp, P. Erdős 

Publication date: 1982

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(82)90032-6

Recommendations

• scientific article; zbMATH DE number 3933121
• A note on graphs containing all trees of a given size.
• A sufficient degree condition for a graph to contain all trees of size \(k\)
• scientific article; zbMATH DE number 3935064
• Spanning trees in random graphs

zbMATH Keywords

Ramsey numbers

Mathematics Subject Classification ID

Trees (05C05) Generalized Ramsey theory (05C55) Structural characterization of families of graphs (05C75)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Some Theorems on Abstract Graphs
• Ramsey Numbers for the Pair Sparse Graph-Path or Cycle
• Panarboreal graphs
• Title not available (Why is that?)

Cited In (10)

• Title not available (Why is that?)
• Graphs with only caterpillars as spanning trees
• Spanning trees: A survey
• Small order graph-tree Ramsey numbers
• Spanning trees of descendants of a complete graph
• Graph-Theoretic Concepts in Computer Science
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Induced-universal graphs for graphs with bounded maximum degree

This page was built for publication: Graphs with certain families of spanning trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1154485)