Graph classes and Ramsey numbers
From MaRDI portal
Publication:400493
DOI10.1016/j.dam.2014.03.016zbMath1298.05220OpenAlexW2085740124MaRDI QIDQ400493
Rémy Belmonte, Pinar Heggernes, Reza Saei, Arash Rafiey, Pim van 't Hof
Publication date: 22 August 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.03.016
Related Items (9)
Graph classes with linear Ramsey numbers ⋮ A width parameter useful for chordal and co-comparability graphs ⋮ Ramsey numbers and graph parameters ⋮ Defective Ramsey numbers and defective cocolorings in some subclasses of perfect graphs ⋮ Small 1-defective Ramsey numbers in perfect graphs ⋮ The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation ⋮ Ramsey numbers of partial order graphs (comparability graphs) and implications in ring theory ⋮ Exact values of defective Ramsey numbers in graph classes ⋮ Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure
Cites Work
- On the recognition of fuzzy circular interval graphs
- On the Ramsey number \(R(4,6)\)
- Independence in graphs with maximum degree four
- The strong perfect graph theorem
- Claw-free graphs. III: Circular interval graphs
- Graphs with restricted valency and matching number
- Degrees and matchings
- Planar Ramsey numbers
- Algorithmic graph theory and perfect graphs
- Ramsey Numbers for Line Graphs and Perfect Graphs
- Partial characterizations of circular-arc graphs
- Efficient Vertex- and Edge-Coloring of Outerplanar Graphs
- Longest paths and cycles in K1,3-free graphs
- Some Ramsey-Type Numbers and the Independence Ratio
- Graph Classes: A Survey
- Lower bounds on size and independence inK4-free graphs
- The Structure of Claw‐Free Perfect Graphs
- The Analogue of Ramsey Numbers for Planar Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Graph classes and Ramsey numbers
