Neighborhood sum discriminative full list coloring of sparse graphs
It was proved for a simple graph G with maximum average degree less than 3.2 and maximum degree Δ(G)≥8,the neighborhood sum discriminative total choice number was estimated at most Δ(G)+2.The proof approach was based on structural analysis and discharging method.
sparse graphneighborhood sum discriminative list total coloringmaximum average degreedischarging method
NETL
NSTL
万方数据
