\(\mathcal Q\)-Ramsey classes of graphs

DOI10.1016/j.disc.2012.02.007zbMath1250.05075MaRDI QIDQ1761462

Anna Fiedorowicz, Mieczysław Borowiecki

Publication date: 15 November 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.02.007

zbMATH Keywords

vertex colouring; hereditary property; \((k,\mathcal Q)\)-Ramsey classes of graphs; vertex Ramsey class

Mathematics Subject Classification ID

05C75: Structural characterization of families of graphs

05C15: Coloring of graphs and hypergraphs

05C55: Generalized Ramsey theory

Uses Software

• ColPack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On acyclic colorings of planar graphs
• Partitioning graphs of bounded tree-width
• Treewidth. Computations and approximations
• Linear coloring of graphs
• Minimum feedback vertex set and acyclic coloring.
• Coloring with no 2-colored \(P_4\)'s
• On acyclic colorings of graphs on surfaces
• Normal hypergraphs and the perfect graph conjecture
• Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation
• Star coloring of graphs
• Acyclic coloring of graphs
• A survey of hereditary properties of graphs
• Graphs maximal with respect to hom-properties
• Acrylic improper colorings of graphs
• On partitions of hereditary properties of graphs
• Boolean Operations on Graphs.
• Acyclic colorings of planar graphs