Minimum sum coloring of P₄-sparse graphs
From MaRDI portal
Publication:2840552
DOI10.1016/J.ENDM.2009.11.048zbMATH Open1268.05063OpenAlexW2091005072MaRDI QIDQ2840552FDOQ2840552
Flavia Bonomo, Mario Valencia-Pabon
Publication date: 19 July 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2009.11.048
Recommendations
Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)
Cites Work
- A tree representation for \(P_ 4\)-sparse graphs
- On chromatic sums and distributed resource allocation
- Minimum Color Sum of Bipartite Graphs
- Approximating min sum set cover
- Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs
- Recognizing $P_4 $-Sparse Graphs in Linear Time
- The chromatic sum of a graph: history and recent developments
- On the sum coloring problem on interval graphs
- On sum coloring of graphs
- Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is $\cal NP$-Complete
- Title not available (Why is that?)
- Approximation results for the optimum cost chromatic partition problem
Cited In (6)
- Minimum sum coloring problem: upper bounds for the chromatic strength
- Computing lower bounds for minimum sum coloring and optimum cost chromatic partition
- A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs
- The packing coloring problem for lobsters and partner limited graphs
- On the minimum sum coloring of \(P_4\)-sparse graphs
- Minimal separators in \(P_4\)-sparse graphs
This page was built for publication: Minimum sum coloring of \(P_{4}\)-sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840552)
