The algorithm for adjacent vertex distinguishing proper edge coloring of graphs
@article{Li2015TheAF,
title={The algorithm for adjacent vertex distinguishing proper edge coloring of graphs},
author={Jingwen Li and Tengyun Hu and Fei Wen},
journal={Discret. Math. Algorithms Appl.},
year={2015},
volume={7},
pages={1550044:1-1550044:13}
}An adjacent vertex distinguishing proper edge coloring of a graph G is a proper edge coloring of G such that no pair of adjacent vertices meet the same set of colors. The minimum number of colors is called adjacent vertex distinguishing proper edge chromatic number of G. In this paper, we present a new heuristic intelligent algorithm to calculate the adjacent vertex distinguishing proper edge chromatic number of graphs. To be exact, the algorithm establishes two objective subfunctions and a…
One Citation
On the Vertex-Distinguishing Equitable Edge Coloring of Product Graph
- Mathematics2019 International Conference on Electronic Engineering and Informatics (EEI)
- 2019
In this paper, we derive two theorems of vertex-distinguishing equitable edge coloring of product graph by using constructive method, and present the vertex-distinguishing equitable edge chromatic…
References
SHOWING 1-10 OF 21 REFERENCES
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five
- MathematicsElectron. Notes Discret. Math.
- 2011
An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
- MathematicsDiscret. Appl. Math.
- 2014
Vertex-distinguishing proper edge-colorings
- MathematicsJ. Graph Theory
- 1997
An edge-coloring is called vertex-distinguishing if every two distinct vertices are incident to different sets of colored edges. The minimum number of colors required for a vertex-distinguishing…
Adjacent vertex-distinguishing edge colorings of K4-minor free graphs
- MathematicsAppl. Math. Lett.
- 2011
Delta+300 is a bound on the adjacent vertex distinguishing edge chromatic number
- MathematicsJ. Comb. Theory, Ser. B
- 2005
Adjacent Vertex Distinguishing Edge-Colorings
- MathematicsSIAM J. Discret. Math.
- 2007
The minimum number of colors required to give an adjacent vertex distinguishing edge-coloring of a simple graph G is proved and a weaker result of the form $\chi^\prime_a(G)=\Delta(G)+O(\log k)$.
Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- MathematicsJ. Comb. Optim.
- 2010
This paper proves that the minimum number of colors required for an adjacent vertex distinguishing edge-coloring of G is χ′a(G)≤Δ+2, if and only if G contains adjacent vertices of maximum degree.
ADJACENT VERTEX DISTINGUISHING TOTAL COLORING OF GRAPHS WITH LOWER AVERAGE DEGREE
- Mathematics
- 2008
An adjacent vertex distinguishing total coloring of a graph $G$ is a proper total coloring of $G$ such that any pair of adjacent vertices are incident to distinct sets of colors. The minimum number…