Uniquely proper distinguishing colorable graphs
<p>A proper vertex-coloring of a graph <span class="math">G</span> is called distinguishing, if the only automorphism preserving the colors is the identity. The minimum number of colors for such a coloring is denoted by <span class="math">χ<sub>D</sub>(G)</span>. We say a graph <span class="math">G<...
محفوظ في:
| المؤلفون الرئيسيون: | , , |
|---|---|
| التنسيق: | Artigo |
| اللغة: | Inglês |
| منشور في: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2025-10-01
|
| سلاسل: | Electronic Journal of Graph Theory and Applications |
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://www.ejgta.org/index.php/ejgta/article/view/1162 |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|