Chromatic sums for colorings avoiding monochromatic subgraphs

DOI10.7151/DMGT.1819zbMATH Open1317.05062OpenAlexW2237027317MaRDI QIDQ2516680FDOQ2516680

Authors: K. A. McKeon, Ewa Kubicka, Grzegorz Kubicki 

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

Recommendations

• Forbidden subgraph edge colorings
• Nordhaus–Gaddum problem in terms of G-free coloring
• Polynomial algorithm for finding chromatic sum for unicyclic and outerplanar graphs.
• Coloring graphs characterized by a forbidden subgraph
• Subgraph-avoiding coloring of graphs

zbMATH Keywords

coloringforbidden subgraphssum of colors

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

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

Cited In (3)

• Vertex partitioning problems on graphs with bounded tree width
• Chromatic sums for colorings avoiding monochromatic subgraphs
• Nordhaus–Gaddum problem in terms of G-free coloring

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

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