Pages that link to "Item:Q2453167"
From MaRDI portal
The following pages link to On the complexity of the selective graph coloring problem in some special classes of graphs (Q2453167):
Displaying 19 items.
- On the minimum and maximum selective graph coloring problems in some graph classes (Q266810) (← links)
- Inverse chromatic number problems in interval and permutation graphs (Q319198) (← links)
- An improved hybrid ant-local search algorithm for the partition graph coloring problem (Q747914) (← links)
- Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks (Q780266) (← links)
- Graph coloring with cardinality constraints on the neighborhoods (Q1040081) (← links)
- Complexity of choosing subsets from color sets (Q1584428) (← links)
- An exact algorithm for the partition coloring problem (Q1651600) (← links)
- On some open problems concerning quorum colorings of graphs (Q1671350) (← links)
- Perfectness of clustered graphs (Q1799385) (← links)
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs (Q2029946) (← links)
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances (Q2286911) (← links)
- A note on selective line-graphs and partition colorings (Q2294381) (← links)
- Dichotomies properties on computational complexity of \(S\)-packing coloring problems (Q2407038) (← links)
- Integrated truck and workforce scheduling to accelerate the unloading of trucks (Q2424789) (← links)
- On some applications of the selective graph coloring problem (Q2629634) (← links)
- A systematic study on meta-heuristic approaches for solving the graph coloring problem (Q2664279) (← links)
- (Q3515552) (← links)
- A comprehensive survey on the generalized traveling salesman problem (Q6556079) (← links)
- The multicolored graph realization problem (Q6558680) (← links)
