Pages that link to "Item:Q1028432"
From MaRDI portal
The following pages link to Complexity results for minimum sum edge coloring (Q1028432):
Displaying 11 items.
- Edge-chromatic sum of trees and bounded cyclicity graphs (Q294800) (← links)
- Minimum sum set coloring of trees and line graphs of trees (Q628310) (← links)
- Minimum sum edge colorings of multicycles (Q987666) (← links)
- Combinatorial algorithms for data migration to minimize average completion time (Q1024212) (← links)
- On sum coloring of graphs (Q1811069) (← links)
- On sum edge-coloring of regular, bipartite and split graphs (Q2448910) (← links)
- A short proof of the NP-completeness of minimum sum interval coloring (Q2488233) (← links)
- Minimum sum multicoloring on the edges of trees (Q2503344) (← links)
- Chromatic Edge Strength of Some Multigraphs (Q3503528) (← links)
- As Time Goes By: Reflections on Treewidth for Temporal Graphs (Q5042450) (← links)
- NP‐completeness of list coloring and precoloring extension on the edges of planar graphs (Q5311921) (← links)