Planar Ramsey numbers
From MaRDI portal
Publication:1322038
DOI10.1006/jctb.1993.1070zbMath0794.05091OpenAlexW2046660404MaRDI QIDQ1322038
Richard Steinberg, Craig A. Tovey
Publication date: 28 August 1994
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1993.1070
Related Items (27)
Triangle-free planar graphs with small independence number ⋮ The planar Ramsey number \(PR(K_4-e,K_5\)) ⋮ Graph classes with linear Ramsey numbers ⋮ Additive list coloring of planar graphs with given girth ⋮ Fractional coloring of triangle-free planar graphs ⋮ Graph classes and Ramsey numbers ⋮ All complete graph-wheel planar Ramsey numbers ⋮ Ramsey numbers and graph parameters ⋮ Defective Ramsey numbers and defective cocolorings in some subclasses of perfect graphs ⋮ QUADRILATERAL-TREE PLANAR RAMSEY NUMBERS ⋮ Maximum face-constrained coloring of plane graphs ⋮ Illuminating labyrinths. ⋮ The planar Ramsey number \(\mathrm{PR}(C_4,K_8)\) ⋮ Planar Ramsey numbers for cycles ⋮ Induced 2-degenerate subgraphs of triangle-free planar graphs ⋮ Small 1-defective Ramsey numbers in perfect graphs ⋮ Independent sets in triangle-free cubic planar graphs ⋮ All quadrilateral-wheel planar Ramsey numbers ⋮ The planar Ramsey number \(PR(C_4,K_7)\) ⋮ Complete graph-tree planar Ramsey numbers ⋮ Large Independent Sets in Triangle-Free Planar Graphs ⋮ Exact values of defective Ramsey numbers in graph classes ⋮ Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces ⋮ Unnamed Item ⋮ Subcubic triangle-free graphs have fractional chromatic number at most 14/5 ⋮ Planar graphs without cycles of length 4 or 5 are \((11 : 3)\)-colorable ⋮ Planar Ramsey graphs
This page was built for publication: Planar Ramsey numbers
