Chromatic sums for colorings avoiding monochromatic subgraphs

DOI10.7151/dmgt.1819zbMath1317.05062OpenAlexW2237027317MaRDI QIDQ2516680

K. A. McKeon, Grzegorz M. Kubicki, Ewa M. Kubicka

Publication date: 4 August 2015

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1819

zbMATH Keywords

coloringforbidden subgraphssum of colors

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Vertex partitioning problems on graphs with bounded tree width ⋮ Chromatic sums for colorings avoiding monochromatic subgraphs

Cites Work

• Conditional chromatic numbers with forbidden cycles
• The subchromatic number of a graph
• Decomposing a planar graph into degenerate graphs
• Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult
• Chromatic sums for colorings avoiding monochromatic subgraphs
• The point-arboricity of a graph
• Defective coloring revisited
• On the linear vertex-arboricity of a planar graph
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• A note on defective colorings of graphs in surfaces
• A survey of hereditary properties of graphs
• Generalized chromatic numbers and additive hereditary properties of graphs
• The Point-Arboricity of Planar Graphs
• Acyclic colorings of planar graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Chromatic sums for colorings avoiding monochromatic subgraphs