Hits :

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

Date of Publication : 2002-01-01

Document Type : 期刊

Journal : Journal of Graph Theory

Volume: Vol.41

Issue : NO.4

Page Number : 307-317

ISSN : 0364-9024

Translation or Not : no

Key Words : Planar;graph;Girth;Light;edge;Game;chromatic;number;Game;coloring;number;Decomposition;Chromatic;number;Theorem

Abstract : Let G be a planar graph 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 (i) Delta(H) less than or equal to 4 if g(G) greater than or equal to 5; (ii)%Delt