On edge orienting methods for graph coloring
From MaRDI portal
Publication:2385485
DOI10.1007/S10878-006-9019-3zbMATH Open1124.05033OpenAlexW2141410486MaRDI QIDQ2385485FDOQ2385485
Bernard Gendron, Patrick St-Louis, Alain Hertz
Publication date: 12 October 2007
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-006-9019-3
Recommendations
- Orientable edge colorings of graphs
- scientific article
- Graph edge coloring: a survey
- Edge-Coloring Problems for Graphs.
- On resolving edge colorings in graphs
- scientific article; zbMATH DE number 1560509
- A polyhedral approach to edge coloring
- scientific article; zbMATH DE number 4008416
- Oriented graph coloring
- Colorings and orientations of graphs
Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A survey of local search methods for graph coloring
- Job Shop Scheduling by Simulated Annealing
- A Column Generation Approach for Graph Coloring
- Nombre chromatique et plus longs chemins d'un graphe
- Title not available (Why is that?)
- Finding the chromatic number by means of critical graphs
- Chromatic Scheduling and the Chromatic Number Problem
- Two novel evolutionary formulations of the graph coloring problem
Cited In (5)
- Parameterized mixed graph coloring
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems
- A wide-ranging computational comparison of high-performance graph colouring algorithms
- Variable space search for graph coloring
- Corrigendum to ``Variable space search for graph coloring [Discrete Appl. Math. 156, No.\,13, 2551--2560 (2008; Zbl 1213.05085)]
Uses Software
This page was built for publication: On edge orienting methods for graph coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2385485)
