Adjacent vertex distinguishing total colorings of outerplanar graphs

Yiqiao Wang and Weifan Wang ()
Additional contact information
Yiqiao Wang: Zhejiang Normal University
Weifan Wang: Zhejiang Normal University

Journal of Combinatorial Optimization, 2010, vol. 19, issue 2, No 1, 123-133

Abstract: Abstract An adjacent vertex distinguishing total coloring of a graph G is a proper total coloring of G such that any pair of adjacent vertices are incident to distinct sets of colors. The minimum number of colors required for an adjacent vertex distinguishing total coloring of G is denoted by χ″ a (G). In this paper, we characterize completely the adjacent vertex distinguishing total chromatic number of outerplanar graphs.

Keywords: Adjacent vertex distinguishing total coloring; Outerplanar graph; Maximum degree (search for similar items in EconPapers)
Date: 2010
References: View complete reference list from CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-008-9165-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:19:y:2010:i:2:d:10.1007_s10878-008-9165-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-008-9165-x

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().