外平面图的区间全染色
The Interval Total Colorings of Outerplane Graphs
DOI: 10.12677/AAM.2021.109312, PDF,   
作者: 张乔慧, 井普宁：浙江师范大学数学与计算机科学学院，浙江 金华
关键词: 区间全染色；外平面图；Interval Total Coloring； Outerplane Graphs
摘要: 图G的一个正常全染色是指一个映射φ:V(G)UE(G)→N，使得V(G)UE(G)中任意两个相邻的或相关联的元素染不同颜色。一个t-区间是指t个连续整数组成的集合。如果G的一个使用了颜色1,2,...,t的全染色使得G中任意顶点v以及与v关联的边使用了dG(v)+1种连续的颜色，其中dG(v)是G中顶点v的度，并且G中至少存在一个顶点或者一条边被染颜色i，i=1,2,...,t，则称此全染色为图G的一个区间全染色。在本文中，我们研究外平面图的区间全染色。
Abstract: A total coloring of a graph G is a mapping φ:V(G)UE(G)→N, such that no adjacent vertices, edges, and no incidnet vertices and edges in V(G)UE(G) obtain the same color. A t-interval is a set of t consecutive integers. An interval total t-coloring of a graph G is a total coloring of with colors G 1,2,...,t such that at least one vertex or edge of G is colored by i, i=1,2,...,t, and the edges incident to each vertex v together with v are colored by dG(v)+1 consecutive colors, where dG(v) is the degree of the vertex v in G. In this paper, we study the interval total coloring of outerplane graphs.
文章引用：张乔慧, 井普宁. 外平面图的区间全染色[J]. 应用数学进展, 2021, 10(9): 2976-2987. https://doi.org/10.12677/AAM.2021.109312

参考文献

[1] Petrosyan, P.A. (2007) Interval Total Colorings of Complete Bipartite Graphs. Proceedings of the CSIT Conference, 84-85.
[2] Petrosyan, P.A. (2008) Interval Total Colorings of Certain Graphs. Mathematical Problems of Computer Science, 31, 122-129.
[3] Petrosyan, P.A. and Torosyan, A.Y. (2009) Interval Total Colorings of Complete Graphs. Proceedings of the CSIT Conference, 99-102.
[4] Petrosyan, P.A. and Shashikyan, A.S. (2009) On Interval Total Colorings of Trees. Mathematical Problems of Computer Science, 32, 70-73.
[5] Petrosyan, P.A. and Khachatryan, N.A. (2009) Interval Total Coloring of Graphs with a Spanning Star. Mathematical Problems of Computer Science, 32, 78-85.
[6] Petrosyan, P.A., Shashikyan, A.S. and Torosyan, A.Y. (2010) Interval Total Colorings of Bipartite Graphs. Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 133-136.
[7] Petrosyan, P.A. and Khachatryan, N.A. (2013) On Interval Total Colorings of the Cartesian Products of Graphs, Discrete Math. Proceedings of the CSIT Conference, 85-86.
[8] Petrosyan, P.A. and Khachatryan, N.A. (2014) Interval Total Colorings of Complete Multipartite Graphs and Hypercubes. Mathematical Problems of Computer Science, 32, 28-42.
[9] 王维凡, 张克明. Δ-匹配与边面全色数[J]. 应用数学学报, 1999(22): 237-242.

为你推荐