The complexity of chromatic strength and chromatic edge strength

DOI10.1007/S00037-005-0201-2MaRDI QIDQ853645zbMATH OpenOpenAlexFDO

Authors Dániel Marx

Publication date 17 November 2006

Published in Computational Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00037-005-0201-2

zbMATH Keywords

chromatic numbercoloringchromatic index

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15)

Recommendations

• On sum coloring of graphs
• The chromatic sum of a graph: history and recent developments
• Chromatic Edge Strength of Some Multigraphs
• Coloring of trees with minimum sum of colors
• Contractions and minimal k-colorability

Cited in

(11)

• The chromatic sum of a graph: history and recent developments
• A note on the strength and minimum color sum of bipartite graphs
• On the equality of domination number and 2-domination number
• Chromatic Edge Strength of Some Multigraphs
• The cost chromatic number and hypergraph parameters
• Minimum sum edge colorings of multicycles
• Complexity results for minimum sum edge coloring
• Chromatic cost coloring of weighted bipartite graphs
• Equality of domination and transversal numbers in hypergraphs
• On sum coloring of graphs
• \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum

Describes a project that uses

Uses Software

• nauty

This page was built for publication: The complexity of chromatic strength and chromatic edge strength

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