Pages that link to "Item:Q2629634"

The following pages link to On some applications of the selective graph coloring problem (Q2629634):

Displaying 20 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)
• New inequalities for network distance measures by using graph spectra (Q1630771) (← links)
• An exact algorithm for the partition coloring problem (Q1651600) (← links)
• Perfectness of clustered graphs (Q1799385) (← links)
• The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation (Q2025063) (← links)
• An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs (Q2029946) (← links)
• The generalized minimum branch vertices problem: properties and polyhedral analysis (Q2031951) (← links)
• On conjectures of network distance measures by using graph spectra (Q2043383) (← links)
• Grouping products for the optimization of production processes: a case in the steel manufacturing industry (Q2184105) (← 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)
• Contrast in greyscales of graphs (Q2307508) (← links)
• Integrated truck and workforce scheduling to accelerate the unloading of trucks (Q2424789) (← links)
• A systematic study on meta-heuristic approaches for solving the graph coloring problem (Q2664279) (← links)
• Total coloring and total matching: polyhedra and facets (Q2673562) (← links)
• ON GRAPH FOLDING AND MOBILE RADIO FREQUENCY ASSIGNMENT (Q5220284) (← links)
• Minimum gradation in greyscales of graphs (Q6108924) (← links)
• The multicolored graph realization problem (Q6558680) (← links)
• Coloring of graphs associated with commutative rings (Q6584796) (← links)