Pages that link to "Item:Q1854776"
From MaRDI portal
The following pages link to Facets of the graph coloring polytope (Q1854776):
Displaying 30 items.
- A polyhedral investigation of star colorings (Q284838) (← links)
- Colorful polytopes and graphs (Q375685) (← links)
- Facet-inducing web and antiweb inequalities for the graph coloring polytope (Q608302) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- Packing and partitioning orbitopes (Q925263) (← links)
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results (Q1015318) (← links)
- Cliques, holes and the vertex coloring polytope (Q1029072) (← links)
- Polyhedral studies of vertex coloring problems: the standard formulation (Q1751160) (← links)
- A branch-and-cut procedure for the Udine course timetabling problem (Q1761891) (← links)
- An exact algorithm for the edge coloring by total labeling problem (Q2178329) (← links)
- The minimum chromatic violation problem: a polyhedral approach (Q2184668) (← links)
- Symmetry-breaking inequalities for ILP with structured sub-symmetry (Q2196292) (← links)
- Graph coloring inequalities from all-different systems (Q2342600) (← links)
- Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model (Q2413162) (← links)
- The minimum chromatic violation problem: a polyhedral study (Q2413191) (← links)
- An integer programming approach to b-coloring (Q2419584) (← links)
- A cutting plane algorithm for graph coloring (Q2467348) (← links)
- On the asymmetric representatives formulation for the vertex coloring problem (Q2482105) (← links)
- A branch-and-cut algorithm for graph coloring (Q2489906) (← links)
- A one-to-one correspondence between colorings and stable sets (Q2517790) (← links)
- Total coloring and total matching: polyhedra and facets (Q2673562) (← links)
- A polyhedral approach for graph coloring (Q2741502) (← links)
- Exact solution of graph coloring problems via constraint programming and column generation (Q2815431) (← links)
- Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope (Q2826670) (← links)
- Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope (Q2840711) (← links)
- The maximum-impact coloring polytope (Q2968505) (← links)
- Polyhedral studies for minimum‐span graph labelling with integer distance constraints (Q5438551) (← links)
- Facet-generating procedures for the maximum-impact coloring polytope (Q5918552) (← links)
- Facet-generating procedures for the maximum-impact coloring polytope (Q5918669) (← links)
- Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures (Q6084673) (← links)