The multicolored graph realization problem

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
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
The symmetric generalized traveling salesman polytope
The complexity of satisfiability problems
Parameterized Algorithms
Fixed-Parameter Tractability and Completeness I: Basic Results
Bipartite permutation graphs
Generalized spanning trees
A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
On the generalized minimum spanning tree problem
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
Fixed-parameter tractability and completeness II: On completeness for W[1]
On the parameterized complexity of multiple-interval graph 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
Graph Theory
Generalized network design problems.
Generalized network design problems. Modeling and optimization.
A retraction problem in graph theory
Finding Maximum Edge Bicliques in Convex Bipartite Graphs
On list \(k\)-coloring convex bipartite graphs
The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
A two-level solution approach for solving the generalized minimum spanning tree problem
On List Coloring and List Homomorphism of Permutation and Interval Graphs
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6558680)