scholarly journals Memetic search for the equitable coloring problem

2020 ◽  
Vol 188 ◽  
pp. 105000 ◽  
Author(s):  
Wen Sun ◽  
Jin-Kao Hao ◽  
Wenyu Wang ◽  
Qinghua Wu
Keyword(s):  
Coloring Problem ◽  
Equitable Coloring

scholarly journals A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives

2014 ◽  
Vol 164 ◽  
pp. 34-46 ◽  
Author(s):  
Laura Bahiense ◽  
Yuri Frota ◽  
Thiago F. Noronha ◽  
Celso C. Ribeiro
Keyword(s):  
Branch And Cut ◽  
Coloring Problem ◽  
Equitable Coloring

scholarly journals Polyhedral results for the Equitable Coloring Problem

2011 ◽  
Vol 37 ◽  
pp. 159-164 ◽  
Author(s):  
I. Méndez-Diaz ◽  
G. Nasini ◽  
D. Severín
Keyword(s):  
Coloring Problem ◽  
Equitable Coloring

scholarly journals Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms

2016 ◽  
Vol 26 (3) ◽  
pp. 281-295 ◽  
Author(s):  
Hanna Furmańczyk ◽  
Andrzej Jastrzębski ◽  
Marek Kubale
Keyword(s):  
Polynomial Time ◽  
Np Hard ◽  
Coloring Problem ◽  
Equitable Coloring ◽  
Practical Algorithms ◽  
Polynomial Time Algorithms ◽  
Sequencing And Scheduling ◽  
General Graphs ◽  
Theoretical Results

AbstractIn many applications in sequencing and scheduling it is desirable to have an underlaying graph as equitably colored as possible. In this paper we survey recent theoretical results concerning conditions for equitable colorability of some graphs and recent theoretical results concerning the complexity of equitable coloring problem. Next, since the general coloring problem is strongly NP-hard, we report on practical experiments with some efficient polynomial-time algorithms for approximate equitable coloring of general graphs.

scholarly journals On the equitable vertex arboricity of complete tripartite graphs

2015 ◽  
Vol 07 (04) ◽  
pp. 1550056
Author(s):  
Zhiwei Guo ◽  
Haixing Zhao ◽  
Yaping Mao
Keyword(s):  
Coloring Problem ◽  
Equitable Coloring ◽  
Vertex Arboricity ◽  
Tripartite Graphs

The equitable coloring problem, introduced by Meyer in 1973, has received considerable attention and research. Recently, Wu et al. introduced the concept of equitable [Formula: see text]-tree-coloring, which can be viewed as a generalization of proper equitable [Formula: see text]-coloring. The strong equitable vertex [Formula: see text]-arboricity of complete bipartite equipartition graphs was investigated in 2013. In this paper, we study the strong equitable vertex [Formula: see text]-arboricity of complete equipartition tripartite graphs. For most cases, the exact values of [Formula: see text] are obtained.

scholarly journals A DSATUR-based algorithm for the Equitable Coloring Problem

2015 ◽  
Vol 57 ◽  
pp. 41-50 ◽  
Author(s):  
Isabel Méndez-Díaz ◽  
Graciela Nasini ◽  
Daniel Severín
Keyword(s):  
Coloring Problem ◽  
Equitable Coloring

scholarly journals A polyhedral approach for the equitable coloring problem

2014 ◽  
Vol 164 ◽  
pp. 413-426 ◽  
Author(s):  
Isabel Méndez-Díaz ◽  
Graciela Nasini ◽  
Daniel Severín
Keyword(s):  
Coloring Problem ◽  
Equitable Coloring ◽  
Polyhedral Approach

scholarly journals An exact DSatur-based algorithm for the Equitable Coloring Problem

2013 ◽  
Vol 44 ◽  
pp. 281-286 ◽  
Author(s):  
Isabel Méndez-Díaz ◽  
Graciela Nasini ◽  
Daniel Severín
Keyword(s):  
Coloring Problem ◽  
Equitable Coloring

A DNA computer model for solving vertex coloring problem

2006 ◽  
Vol 51 (20) ◽  
pp. 2541-2549 ◽  
Author(s):  
Jin Xu ◽  
Xiaoli Qiang ◽  
Fang Gang ◽  
Kang Zhou
Keyword(s):  
Computer Model ◽  
Vertex Coloring ◽  
Coloring Problem ◽  
Vertex Coloring Problem ◽  
Dna Computer
Sign in / Sign up

Export Citation Format

Share Document