On some applications of the selective graph coloring problem
From MaRDI portal
Publication:2629634
Recommendations
- On the minimum and maximum selective graph coloring problems in some graph classes
- Selective graph coloring in some special classes of graphs
- On the complexity of the selective graph coloring problem in some special classes of graphs
- A note on selective line-graphs and partition colorings
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
Cites work
- A branch-and-cut algorithm for partition coloring
- A branch-and-price approach for the partition coloring problem
- A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
- A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding
- A tutorial on the use of graph coloring for some problems in robotics
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
- Algorithmic graph theory and perfect graphs
- Algorithms for a maximum clique and a maximum independent set of a circle graph
- Claw-free graphs. VII. Quasi-line graphs
- Frequency planning and ramifications of coloring
- scientific article; zbMATH DE number 1731177 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- On coloring unit disk graphs
- On rectangle intersection and overlap graphs
- On the complexity of the selective graph coloring problem in some special classes of graphs
- On the minimum and maximum selective graph coloring problems in some graph classes
- Operations research at container terminals: a literature update
- Optimal berth allocation and time-invariant quay crane assignment in container terminals
- Partial integration of frequency allocation within antenna positioning in GSM mobile networks
- Perfectness of clustered graphs
- Routing and wavelength assignment by partition colouring
- Selective graph coloring in some special classes of graphs
- The Complexity of Coloring Circular Arcs and Chords
- The complexity of path coloring and call scheduling
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- The graph coloring problem: A neuronal network approach
- The structure of claw-free graphs
- Unit disk graph recognition is NP-hard
- Unit disk graphs
Cited in
(26)- New inequalities for network distance measures by using graph spectra
- An exact algorithm for the partition coloring problem
- Perfectness of clustered graphs
- The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
- The generalized minimum branch vertices problem: properties and polyhedral analysis
- On conjectures of network distance measures by using graph spectra
- Grouping products for the optimization of production processes: a case in the steel manufacturing industry
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
- A note on selective line-graphs and partition colorings
- Contrast in greyscales of graphs
- Integrated truck and workforce scheduling to accelerate the unloading of trucks
- On the complexity of the selective graph coloring problem in some special classes of graphs
- A systematic study on meta-heuristic approaches for solving the graph coloring problem
- On the minimum and maximum selective graph coloring problems in some graph classes
- Total coloring and total matching: polyhedra and facets
- Selective graph coloring in some special classes of graphs
- Inverse chromatic number problems in interval and permutation graphs
- Graph coloring models and metaheuristics for packing applications
- On graph folding and mobile radio frequency assignment
- Minimum gradation in greyscales of graphs
- The multicolored graph realization problem
- Coloring of graphs associated with commutative rings
- A set packing model for the partition coloring problem
- Enhancing the scalability of shared-memory finite-element simulations: application to polymer waterflooding in porous media
- Precoloring extension with demands on paths
This page was built for publication: On some applications of the selective graph coloring problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2629634)
