Classes of graphs that exclude a tree and a clique and are not vertex Ramsey
From MaRDI portal
Publication:1375696
DOI10.1007/BF01271268zbMath0881.05094OpenAlexW2087931854MaRDI QIDQ1375696
Yingxian Zhu, Henry A. Kierstead
Publication date: 11 January 1998
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01271268
Cites Work
- Unnamed Item
- Unnamed Item
- Induced subtrees in graphs of large chromatic number
- Ramsey families which exclude a graph
- Applications of hypergraph coloring to coloring graphs not inducing certain trees
- The Ramsey Property for Families of Graphs Which Exclude a Given Graph
- Radius two trees specify χ‐bounded classes
- On-Line Coloring and Recursive Graph Theory
- Classes of Graphs that Are Not Vertex Ramsey
- On the Ramsey Property of Families of Graphs
This page was built for publication: Classes of graphs that exclude a tree and a clique and are not vertex Ramsey
