Keyphrases
Harmonious Chromatic number
100%
Achromatic number
54%
Color number
53%
Harmonious Coloring
53%
Proper Vertex Coloring
43%
Simple Graph
43%
Fragmentability
41%
Bounded Degree
38%
Maximum Degree
35%
Complete Coloring
27%
Positive Integer
26%
Number of Vertices
22%
NP-hard
21%
Planarization
20%
Bounded Degree Graphs
18%
Max-CSP
18%
New Upper Bound
18%
Number of Edges
16%
NP-complete
16%
Graph Coloring
15%
Fragmentable
13%
Polynomial-time Algorithm
13%
Color Set
12%
Incident Edges
12%
General Graphs
12%
Monochromatic Component
10%
Left behind
10%
Planar Graph
10%
Edge Decomposition
9%
Tripartite Graph
9%
Complete Tripartite Graph
9%
Pseudoachromatic number
9%
Cordial Labeling
9%
Reduction Theorem
9%
Hypergraph Coloring
9%
Improper Coloring
9%
Component Size
9%
Performance Ratio
9%
Complete Graph
9%
Neighbor-distinguishing Coloring
9%
Proper Edge Coloring
9%
Adjacent Vertices
9%
New Lower Bound
9%
Neighbor-distinguishing Index
9%
Planar Bipartite Graphs
9%
Index of a Graph
9%
Vertex Coloring
9%
Coloring Problem
9%
Enumeration Problem
9%
Dense Graphs
9%
Mathematics
Edge
51%
Chromatic Number
47%
Upper Bound
39%
Maximum Degree
37%
Simple Graph
29%
Polynomial Time
22%
Planar Graph
18%
Triangle
12%
Necessary and Sufficient Condition
12%
Free Graph
12%
Parallelization
9%
Regular Graph
9%
Complete Graph
9%
Hypergraphs
9%
Polynomial
9%
Positive Constant
9%
Linear Equation
9%
Cube
9%
Fast Algorithm
9%
