On subgraphs without large components.

DOI10.21136/MB.2017.0013-14MaRDI QIDQ5270999zbMATH OpenOpenAlexFDO

Authors Glenn G. Chappell, John Gimbel

Publication date 3 July 2017

Published in MATHEMATICA BOHEMICA (Search for Journal in Brave)

Full work available at URL https://doi.org/10.21136/mb.2017.0013-14

zbMATH Keywords

componentgraph coloringindependenceRamsey number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Ramsey theory (05D10)

Recommendations

• scientific article; zbMATH DE number 2044932
• Graph Subcolorings: Complexity and Algorithms
• scientific article; zbMATH DE number 1002021
• Coloring graphs characterized by a forbidden subgraph
• Subcolorings and the subchromatic number of a graph

Cited in

(7)

• Advances on defective parameters in graphs
• Small 1-defective Ramsey numbers in perfect graphs
• On the \(k\)-component independence number of a tree
• Exact values of defective Ramsey numbers in graph classes
• Defective Ramsey numbers and defective cocolorings in some subclasses of perfect graphs
• A precise threshold for quasi-Ramsey numbers
• Some of my favorite coloring problems for graphs and digraphs

This page was built for publication: On subgraphs without large components.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5270999)