The vertex coloring problem and its generalizations
type: Item
instance of: scholarly article
title: The vertex coloring problem and its generalizations
zbMATH Open document ID: 1165.05010
author: Enrico Malaguti
published in: 4OR
publication date: 2009-06-22T00:00:00Z
full work available at URL: TESI Malaguti.pdf
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90B18
zbMATH DE Number: 5567073
zbMATH Keywords: vertex coloring problem
zbMATH Keywords: routing problem in telecommunication networks
zbMATH Keywords: efficiency of a solution
zbMATH Keywords: fairness of a solution
describes a project that uses: CALMA
MaRDI profile type: Publication
OpenAlex ID: W2037817070
cites work: Algorithms for the bin packing problem with conflicts
cites work: Batch processing with interval graph compatibilities between tasks
cites work: Heuristics and lower bounds for the bin packing problem with conflicts
cites work: Efficient and fair routing for mesh networks
cites work: An evolutionary approach for bandwidth multicoloring problems
cites work: Models and heuristic algorithms for a weighted vertex coloring problem
cites work: A metaheuristic approach for the vertex coloring problem
DOI: 10.1007/S10288-008-0071-Y
Recommended article: Some generalizations of theorems on vertex coloring
Recommended article: A survey on vertex coloring problems
Recommended article: A NEW APPROACH TO THE VERTEX COLORING PROBLEM
Recommended article: An exact approach for the vertex coloring problem
Recommended article: Two complexity results for the vertex coloring problem
Recommended article: The complexity of generalized graph colorings
Recommended article: On a theorem about vertex colorings of graphs
Recommended article: The intersection of two vertex coloring problems
Recommended article: The complexity of some graph colouring problems
Recommended article: Parameterized complexity of vertex colouring
description: scientific article; zbMATH DE number 5567073