A simple branching scheme for vertex coloring problems
type: Item
instance of: scholarly article
title: A simple branching scheme for vertex coloring problems
zbMATH Open document ID: 1237.05075
author: Stefano Gualandi
author: Federico Malucelli
published in: Discrete Applied Mathematics
publication date: 2012-03-19T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6015798
zbMATH Keywords: branching scheme
zbMATH Keywords: graph coloring
zbMATH Keywords: vertex coloring
zbMATH Keywords: graph extension
zbMATH Keywords: extension operator
zbMATH Keywords: graph bandwidth coloring
zbMATH Keywords: graph bandwidth multicoloring
describes a project that uses: CALMA
MaRDI profile type: Publication
full work available at URL: j.dam.2011.10.012
OpenAlex ID: W1999377519
cites work: Models and solution techniques for frequency assignment problems
cites work: An Algorithm for Determining the Chromatic Number of a Graph
cites work: Frequency assignment in mobile radio systems using branch-and-cut techniques
cites work: Exact solution of graph coloring problems via constraint programming and column generation
cites work: A column generation and branch-and-cut algorithm for the channel assignment problem
cites work: A survey on vertex coloring problems
cites work: Determining the Chromatic Number of a Graph
cites work: A Branch-And-Price Approach for Graph Multi-Coloring
cites work: A Column Generation Approach for Graph Coloring
cites work: Q5790850
DOI: 10.1016/J.DAM.2011.10.012
Recommended article: A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
Recommended article: A branch-and-cut algorithm for graph coloring
Recommended article: A Wide Branching Strategy for the Graph Coloring Problem
Recommended article: An exact approach for the vertex coloring problem
Recommended article: A NEW APPROACH TO THE VERTEX COLORING PROBLEM
Recommended article: Bounding vertex coloring by truncatedmultistage branch and bound
Recommended article: The vertex coloring problem and its generalizations
Recommended article: A survey on vertex coloring problems
Recommended article: Efficient bounds on a branch and bound algorithm for graph colouration
Recommended article: A branch-and-cut algorithm for partition coloring
description: scientific article; zbMATH DE number 6015798