On the adjacent vertex distinguishing total chromatic number of outer plane graph

Title
On the adjacent vertex distinguishing total chromatic number of outer plane graph
Author(s)
이재운Weizen Wang[Weizen Wang]Li-hing Yan[Li-hing Yan]Zhong-fu Zhang[Zhong-fu Zhang]
Issue Date
201210
Publisher
CHARLES BABBAGE RES CTR
Citation
ARS COMBINATORIA, v.107, pp.499 - 514
Abstract
A total coloring of a simple graph G is called adjacent vertex distinguishing if for any two adjacent and distinct vertices u and v in G, the set of colors assigned to the vertices and the edges incident to u differs from the set of colors assigned to the vertices and the edges incident to v. In this paper we shall prove the adjacent vertex distinguishing total chromatic number of outer plane graph with Delta <= 5 is Delta + 2 if G have two adjacent maximum degree vertices, otherwise is Delta + 1.
URI
http://hdl.handle.net/YU.REPOSITORY/27084
ISSN
0381-7032
Appears in Collections:
이과대학 > 수학과 > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE