On the Maximum Number of Dominating Classes in Graph Coloring

ISSN Print: 2161-7635
ISSN Online: 2161-7643
www.scirp.net/journal/ojdm
E-mail: [email protected]

Citations

"On the Maximum Number of Dominating Classes in Graph Coloring"
written by Bing Zhou,
published by Open Journal of Discrete Mathematics, Vol.6 No.2, 2016

has been cited by the following article(s):

[1]	Solving graph coloring problem using divide and conquer-based turbulent particle swarm optimization
	Arabian Journal for Science and …, 2022

[2]	A New Multi-Objective Evolutionary Approach to Graph Coloring and Channel Allocation Problems
	Journal of Applied …, 2021

[3]	Complexity Analysis and Stochastic Convergence of Some Well-known Evolutionary Operators for Solving Graph Coloring Problem
	2020

[4]	γ-Chromatic Partition in Planar Graph Characterization
	2019

[5]	Planar and Non Planar Construction of γ-Uniquely Colorable Graph
	2018

[6]	Solution to Graph Coloring Using Genetic and Tabu Search Procedures
	2017

[7]	Planar graph characterization of γ-Uniquely colorable graphs
	2017

[8]	Planar graph characterization of gamma-Uniquely colorable graphs
	2017

[1]	Unlocking the hidden potential of Mexican teosinte seeds: revealing plant growth-promoting bacterial and fungal biocontrol agents Frontiers in Plant Science, 2023 DOI:10.3389/fpls.2023.1247814

[2]	Complexity Analysis and Stochastic Convergence of Some Well-known Evolutionary Operators for Solving Graph Coloring Problem Mathematics, 2020 DOI:10.3390/math8030303

[3]	Applied Mathematics and Scientific Computing Trends in Mathematics, 2019 DOI:10.1007/978-3-030-01123-9_45

[4]	Solution to Graph Coloring Using Genetic and Tabu Search Procedures Arabian Journal for Science and Engineering, 2017 DOI:10.1007/s13369-017-2686-9

Top