On graphs \(G\) for which all large trees are \(G\)-good

DOI10.1007/BF02988318zbMath0788.05069MaRDI QIDQ1313348

Stefan A. Burr, Ralph J. Faudree

Publication date: 30 May 1994

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

treechromatic numbercolorssurplusgeneralized Ramsey number

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (1)

A large tree is \(tK_m\)-good

Cites Work

• Multipartite graph-sparse graph Ramsey numbers
• Goodness of trees for generalized books
• Unterteilungen vollständiger Graphen in Graphen mit unendlicher chromatischer Zahl
• Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
• Ramsey Numbers for the Pair Sparse Graph-Path or Cycle
• An inequality involving the vertex arboricity and edge arboricity of a graph
• Ramsey Numbers Involving Graphs with Long Suspended Paths
• On Representatives of Subsets
• An inequality for the chromatic number of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On graphs \(G\) for which all large trees are \(G\)-good