The complexity of chromatic strength and chromatic edge strength
From MaRDI portal
Publication:853645
DOI10.1007/s00037-005-0201-2zbMath1103.05032OpenAlexW2093305636MaRDI QIDQ853645
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
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
Chromatic Edge Strength of Some Multigraphs ⋮ Equality of domination and transversal numbers in hypergraphs ⋮ A note on the strength and minimum color sum of bipartite graphs ⋮ Minimum sum edge colorings of multicycles ⋮ \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum ⋮ Complexity results for minimum sum edge coloring
Uses Software
This page was built for publication: The complexity of chromatic strength and chromatic edge strength
