Hits :

First Author : Wei-Fan Wang

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

Date of Publication : 2006-01-01

Document Type : 期刊

Journal : Discrete Mathematics

Volume: Vol.306

Issue : NO.2

Page Number : 262-270

ISSN : 0012-365X

Translation or Not : no

Key Words : Graph;of;nonnegative;characteristic;Game;coloring;number;Girth;Cycle;Edge-decomposition

Abstract : Let G be a graph of nonnegative characteristic and let g(G) and Delta(G) be its girth and maximum degree, respectively. We show that G has an edge-partition into a forest and a subgraph H so that (1) Delta(H) less than approximately equals 1 if g(G) great