Conjecture 4. (The 1,2-conjecture [10, 14, 15]) Every graph G=(V,E)

has a coloring chip conguration c : V

∪ E −→ {1; 2}.

Article The 1-2-3-edge labeling and vertex coloring of complete grap...

More Mohammad Reza Farahani's questions See All
Similar questions and discussions