Hits :

First Author : Weifan Wang

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2012-01-01

Document Type : 期刊

Journal : Journal of Combinatorial Optimization

Volume: Vol.23

Issue : No.1

Page Number : 79-93

ISSN : 1382-6905

Translation or Not : no

Key Words : Backbone;coloring;Halin;graph;Maximum;average;degree;Spanning;tree;Hamiltonian;path

Abstract : Let G be a graph and H a subgraph of G. A backbone-k-coloring of (G,H) is a mapping f: V(G)→{1,2,…,k} such that |f(u)−f(v)|≥2 if uv∈E(H) and |f(u)−f(v)|≥1 if uv∈E(G)\E(H). The backbone chromatic number of (G,H) is the smallest integer k such that (G,H) ha