Name
Title | ||
|---|---|---|
On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree. |
Abstract | ||
|---|---|---|
Given a graph G=(V,E), if its vertex set V(G) can be partitioned into two non-empty subsets V1 and V2 such that G[V1] is edgeless and G[V2] is a graph with maximum degree at most k, then we say that G admits an (I, Δk)-partition. A similar definition can be given for the notation (I, Fk)-partition if G[V2] is a forest with maximum degree at most k. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.amc.2018.01.003 | Applied Mathematics and Computation |
Keywords | Field | DocType |
Vertex partition,Maximum average degree,Forest,Girth | Graph,Combinatorics,Vertex (geometry),Mathematical analysis,Degree (graph theory),Vertex partition,Corollary,Mathematics,Planar graph,Bounded function | Journal |
Volume | ISSN | Citations |
326 | 0096-3003 | 0 |
PageRank | References | Authors |
0.34 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Min Chen | 1 | 79 | 10.52 |
| Weiqiang Yu | 2 | 0 | 0.34 |
| Weifan Wang | 3 | 868 | 89.92 |