Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation
type: Item
instance of: scholarly article
title: Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation
zbMATH Open document ID: 1066.90109
author: Jon Lee
author: Sven Vries
author: Janny Leung
published in: Journal of Combinatorial Optimization
publication date: 2005-05-17T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 2168266
zbMATH Keywords: edge coloring
zbMATH Keywords: integer program
zbMATH Keywords: binary encoding
zbMATH Keywords: odd cycle
zbMATH Keywords: separation
MaRDI profile type: Publication
full work available at URL: s10878-005-5484-3
OpenAlex ID: W2060178757
cites work: A new method of proving theorems on chromatic index
cites work: The NP-Completeness of Edge-Coloring
cites work: All-different polytopes
cites work: A comparison of two edge-coloring formulations
cites work: A polyhedral approach to edge coloring
DOI: 10.1007/S10878-005-5484-3
Recommended article: Odd properly colored cycles in edge-colored graphs
Recommended article: Complexity separating classes for edge-colouring and total-colouring
Recommended article: Q5449144
Recommended article: Odd edge-colorability of subcubic graphs
Recommended article: Cobounding odd cycle colorings
Recommended article: Q4033261
Recommended article: A generalization of interval edge-colorings of graphs
Recommended article: A generalization of edge-coloring in graphs
Recommended article: Odd graph and its applications to the strong edge coloring
Recommended article: Edge coloring of bipartite graphs with constraints
description: scientific article; zbMATH DE number 2168266