Hits :

First Author : Bu, Yuehua

Date of Publication : 2015-01-01

Journal : Theoretical Computer Science

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

Document Type : 期刊

Volume : Vol.580

Page Number : 50-58

ISSN : 0304-3975

Key Words : Backbone;coloring;Cycle;Planar;graph;Spanning;tree

Abstract : Let G = ( V , E ) be a graph and H be a spanning subgraph of G . A backbone- k -coloring of ( G , H ) is a mapping φ : V ( G ) → { 1 , 2 , ⋅ ⋅ ⋅ , k } such that | φ ( u ) − φ ( v ) | ≥ 2 if u v ∈ E ( H ) and | φ ( u ) − φ ( v ) | ≥ 1 if u v ∈ E ( G ) \ E

Translation or Not : no