The (Adjacent) Vertex-Distinguishing Total Coloring of the Mycielski Graphs and the Cartesian Product Graphs

机译：Mycielski图和笛卡尔乘积图的（相邻）可区分顶点的总着色

获取原文

获取原文并翻译 | 示例

页面导航

摘要
著录项
相似文献
相关主题

摘要

The graph obtained by the famous Mycielski's construction is called the Mycielski graph. This paper focuses on the relation between the basic graphs and two classes of constructed graphs on the (adjacent) vertex-distinguishing total coloring. And some sufficient conditions with which the Mycielski graphs and the Cartesian product graphs satisfy the adjacent vertex-distinguishing total coloring conjecture are given.

机译：由著名的Mycielski结构获得的图称为Mycielski图。本文着眼于基本图与（相邻）顶点可区分的总着色上的两类构造图之间的关系。给出了Mycielski图和笛卡尔乘积图满足相邻的可区分顶点的总着色猜想的一些充分条件。

著录项

来源
《Discrete Geometry, Combinatorics and Graph Theory; Lecture Notes in Computer Science; 4381》|2005年|200-205|共6页
会议地点 Tianjing and Xian(CN)
作者
Yanli Sun; Lei Sun;
展开▼
作者单位

College of Information and Engineering, Taishan Medical University, Taian 271016,P.R. China;

Department of Mathematics, Shandong Normal University, Jinan 250014,P.R. China;

展开▼
会议组织
原文格式 PDF
正文语种 eng
中图分类计算技术、计算机技术;
关键词

相似文献

外文文献
中文文献
专利

1. ADJACENT VERTEX DISTINGUISHING EDGE-COLORINGS AND TOTAL-COLORINGS OF THE CARTESIAN PRODUCT OF GRAPHS [J] . SHUANGLIANG TIAN, PING CHEN, YABIN SHAO, Numerical Algebra, Control and Optimization . 2014,第1期

机译：图的笛卡尔积的相邻顶点区分边缘着色和总着色
2. On the adjacent vertex-distinguishing total colorings of some cubic graphs [J] . Yun Feng1, Wensong Lin2 Journal of combinatorial mathematics and combinatorial computing . 2019,第MAY期

机译：关于某些三次图的相邻可区分顶点的全色
3. On the adjacent vertex-distinguishing total colorings of some cubic graphs [J] . Yun Feng1, Wensong Lin2 Journal of combinatorial mathematics and combinatorial computing . 2019,第May期

机译：在相邻的顶点区分某些立方图的总着色
4. Adjacent vertex-distinguishing E-total coloring on the multiple join graph of several kinds of particular graphs [C] . Muchun Li, Li Zhang International conference on electrical insulating materials and electrical engineering . 2012

机译：几种特定图形的多重连接图上相邻的可区分顶点的E-total着色
5. Efficient algorithms for graph coloring: Vertex, edge, list, total, and acyclic coloring. [D] . Skulrattanakulchai, San. 2002

机译：图形着色的高效算法：顶点，边，列表，总计和非循环着色。
6. On the bounds of degree-based topological indices of the Cartesian product of F-sum of connected graphs [O] . Muhammad Imran, Shakila Baby, Hafiz Muhammad Afzal Siddiqui, -1

机译：关于连通图F-sum的笛卡尔积的基于度的拓扑指数的界
7. ADJACENT VERTEX-DISTINGUISHING TOTAL COLORING OF GENERAL MYCIELSKI OF $P_n$ AND $C_n$ [O] . Z. Chuancheng, R. Zhiguo, L. Jun, 2015

机译：邻近的顶点区分常见的Mycielski的总着色$ p_n $和$ c_n $

The (Adjacent) Vertex-Distinguishing Total Coloring of the Mycielski Graphs and the Cartesian Product Graphs

摘要

著录项

相似文献

相关主题

期刊订阅