Complete graph-tree planar Ramsey numbers
From MaRDI portal
Publication:2287756
Recommendations
Cites work
- All complete graph-wheel planar Ramsey numbers
- All quadrilateral-wheel planar Ramsey numbers
- Congruent Graphs and the Connectivity of Graphs
- Construction of planar triangulations with minimum degree 5
- Critically n-Connected Graphs
- Double-star-like trees in the complement of a planar graph
- Grötzsch's theorem on 3-colorings
- scientific article; zbMATH DE number 4099362 (Why is no real title available?)
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 3545699 (Why is no real title available?)
- scientific article; zbMATH DE number 6273763 (Why is no real title available?)
- Planar Ramsey numbers
- Planar Ramsey numbers for cycles
- Planar Ramsey numbers for small graphs
- Polarity graphs and Ramsey numbers for \(C_4\) versus stars
- QUADRILATERAL-TREE PLANAR RAMSEY NUMBERS
- Some values of Ramsey numbers for \(C_4\) versus stars
- The Analogue of Ramsey Numbers for Planar Graphs
- The planar Ramsey number \(\mathrm{PR}(C_4,K_8)\)
- The planar Ramsey number PR(C₄,K₇)
- The planar Ramsey number \(PR(K_4-e,K_5\))
- The planar Ramsey number for C₄ and K₅ is 13
Cited in
(9)- Planar Ramsey numbers
- Planar Ramsey graphs
- Some modifications of Ramsey numbers
- Double-star-like trees in the complement of a planar graph
- QUADRILATERAL-TREE PLANAR RAMSEY NUMBERS
- scientific article; zbMATH DE number 2145239 (Why is no real title available?)
- Planar Ramsey Numbers
- The planar Ramsey number \(PR(K_4-e,K_5\))
- All complete graph-wheel planar Ramsey numbers
This page was built for publication: Complete graph-tree planar Ramsey numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2287756)