Hits :

First Author : Min Chen

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

Date of Publication : 2018-01-01

Document Type : 期刊

Journal : Applied Mathematics and Computation

Volume: Vol.326

Page Number : 117-123

ISSN : 0096-3003

Translation or Not : no

Key Words : Vertex;partition;Maximum;average;degree;Forest;Girth

Abstract : Given a graph G = ( V , E ) , if its vertex set V(G) can be partitioned into two non-empty subsets V 1  and V 2  such that G[V 1 ] is edgeless and G[V 2 ] is a graph with maximum degree at most k, then we say that G admits an (I, Δ k )-partition. A simila