Pages that link to "Item:Q2978431"
From MaRDI portal
The following pages link to A survey of graph coloring - its types, methods and applications (Q2978431):
Displaying 11 items.
- Computational complexity of distance edge labeling (Q1647838) (← links)
- Solving graph coloring problems with the Douglas-Rachford algorithm (Q1653324) (← links)
- An efficient parallel block coordinate descent algorithm for large-scale precision matrix estimation using graphics processing units (Q2135867) (← links)
- An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm (Q2176284) (← links)
- Total coloring conjecture for certain classes of graphs (Q2283827) (← links)
- A systematic study on meta-heuristic approaches for solving the graph coloring problem (Q2664279) (← links)
- A Lower Bound of the cd-Chromatic Number and Its Complexity (Q2971664) (← links)
- (Q5076797) (← links)
- COMPUTATION OF b-CHROMATIC TOPOLOGICAL INDICES OF SOME GRAPHS AND ITS DERIVED GRAPHS (Q6123854) (← links)
- Optimal secret share distribution in degree splitting communication networks (Q6186165) (← links)
- Upper bounds for some graph invariants in terms of blocks and cut-vertices (Q6657261) (← links)
