The multicolored graph realization problem

Cites Work

Unnamed Item
Unnamed Item
Generalized network design problems. Modeling and optimization.
Fixed-parameter tractability and completeness II: On completeness for W[1]
On the parameterized complexity of multiple-interval graph problems
A retraction problem in graph theory
Bipartite permutation graphs
Generalized spanning trees
A two-level solution approach for solving the generalized minimum spanning tree problem
Generalized network design problems.
On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
An efficient transformation of the generalized vehicle routing problem
On list \(k\)-coloring convex bipartite graphs
The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem
On the complexity of the selective graph coloring problem in some special classes of graphs
Parametrized complexity theory.
On some applications of the selective graph coloring problem
Graph Theory
Finding Maximum Edge Bicliques in Convex Bipartite Graphs
A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
Fixed-Parameter Tractability and Completeness I: Basic Results
On the generalized minimum spanning tree problem
The symmetric generalized traveling salesman polytope
On List Coloring and List Homomorphism of Permutation and Interval Graphs
The complexity of satisfiability problems
Parameterized Algorithms
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

This page was built for publication: The multicolored graph realization problem