scientific article; zbMATH DE number 1947053
From MaRDI portal
Publication:4411283
Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
- Analysis of approximate algorithms for edge-coloring bipartite graphs
- An approximate algorithm for the chromatic number of graphs
- Experimental and Efficient Algorithms
- Approximating the achromatic number problem on bipartite graphs
- Sum coloring of bipartite graphs with bounded degree
- scientific article; zbMATH DE number 1998817
- scientific article; zbMATH DE number 7650095
- A matched approximation bound for the sum of a greedy coloring
- On approximating the b-chromatic number
- Approximate constrained bipartite edge coloring
Cited in
(23)- Complexity results for minimum sum edge coloring
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
- A matched approximation bound for the sum of a greedy coloring
- Comparison of sum choice number with chromatic sum
- A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\)
- On sum edge-coloring of regular, bipartite and split graphs
- Minimum sum coloring of \(P_{4}\)-sparse graphs
- Chromatic Edge Strength of Some Multigraphs
- Minimum Color Sum of Bipartite Graphs
- scientific article; zbMATH DE number 1163713 (Why is no real title available?)
- Approximation results for the optimum cost chromatic partition problem
- The minimum color sum of bipartite graphs
- Approximation Results for the Optimum Cost Chromatic Partition Problem
- scientific article; zbMATH DE number 7561584 (Why is no real title available?)
- Algorithms and Computation
- Approximating the achromatic number problem on bipartite graphs
- Minimum sum set coloring of trees and line graphs of trees
- Chromatic cost coloring of weighted bipartite graphs
- Probabilistic graph-coloring in bipartite and split graphs
- On the minimum sum coloring of P₄-sparse graphs
- On sum coloring and sum multi-coloring for restricted families of graphs
- A note on the strength and minimum color sum of bipartite graphs
- Minimum sum edge colorings of multicycles
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411283)
