Subgraph-avoiding coloring of graphs

DOI10.1002/JGT.20428MaRDI QIDQ3553235zbMATH OpenOpenAlexFDO

Authors Jia Shen

Publication date 22 April 2010

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20428

zbMATH Keywords

\(F\)-free subgraphclique-coloringcoloringhypergraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Recommendations

• Characterization of forbidden subgraphs for bounded star chromatic number
• Graph colourings with forbidden \(k\)-coloured subgraphs
• Forbidden subgraph edge colorings
• Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
• Vertex colorings without rainbow or monochromatic subgraphs

Cites work

• Clique-coloring some classes of odd-hole-free graphs
• Coloring the Maximal Cliques of Graphs
• Complexity of clique coloring and related problems
• Fibres and ordered set coloring
• On the complexity of bicoloring clique hypergraphs of graphs
• On the divisibility of graphs
• The Grötzsch theorem for the hypergraph of maximal cliques

Cited in

(10)

• Avoiding rainbow induced subgraphs in vertex-colorings
• Subgraphs of colour-critical graphs
• Characterization of forbidden subgraphs for bounded star chromatic number
• When will every maximal \(F\)-free subposet contain a maximal element?
• Chromatic sums for colorings avoiding monochromatic subgraphs
• Graph colourings with forbidden \(k\)-coloured subgraphs
• SUB-COLORING AND HYPO-COLORING INTERVAL GRAPHS
• Vertex colorings without rainbow subgraphs
• Forbidden subgraph edge colorings
• Anagram-Free Colorings of Graph Subdivisions

This page was built for publication: Subgraph-avoiding coloring of graphs

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