• Complex
  • Title
  • Keyword
  • Abstract
  • Scholars
  • Journal
  • ISSN
  • Conference
成果搜索

author:

Hou, Jian-Feng (Hou, Jian-Feng.) [1] | Wu, Jian-Liang (Wu, Jian-Liang.) [2] | Liu, Gui-Zhen (Liu, Gui-Zhen.) [3] | Liu, Bin (Liu, Bin.) [4]

Indexed by:

EI

Abstract:

A proper edge coloring of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by x'a(G), is the least number of colors in an acyclic edge coloring of G.In this paper, we determine completely the acyclic edge chromatic number of outerplanar graphs. The proo is constructive and supplies a polynomial time algorithm to acyclically color the edges of any outerplanar graph G USing áa(G) colors. © 2009 Wiley Periodicals, Inc.

Keyword:

Color Graphic methods Graph theory Polynomial approximation

Community:

  • [ 1 ] [Hou, Jian-Feng]School of Mathematics, Shandong University, Jinan 250100, China
  • [ 2 ] [Hou, Jian-Feng]Center for Discrete Mathematics, Fuzhou University, Fuzhou 350002, China
  • [ 3 ] [Wu, Jian-Liang]School of Mathematics, Shandong University, Jinan 250100, China
  • [ 4 ] [Liu, Gui-Zhen]School of Mathematics, Shandong University, Jinan 250100, China
  • [ 5 ] [Liu, Bin]School of Mathematics, Shandong University, Jinan 250100, China

Reprint 's Address:

Show more details

Related Keywords:

Related Article:

Source :

Journal of Graph Theory

ISSN: 0364-9024

Year: 2010

Issue: 1

Volume: 64

Page: 22-36

0 . 5 6 1

JCR@2010

0 . 9 0 0

JCR@2023

JCR Journal Grade:3

CAS Journal Grade:3

Cited Count:

WoS CC Cited Count:

SCOPUS Cited Count: 30

ESI Highly Cited Papers on the List: 0 Unfold All

WanFang Cited Count:

Chinese Cited Count:

30 Days PV: 2

Affiliated Colleges:

Online/Total:158/10038769
Address:FZU Library(No.2 Xuyuan Road, Fuzhou, Fujian, PRC Post Code:350116) Contact Us:0591-22865326
Copyright:FZU Library Technical Support:Beijing Aegean Software Co., Ltd. 闽ICP备05005463号-1