9 research outputs found

    Equitable partition of graphs into induced forests

    Full text link
    An equitable partition of a graph GG is a partition of the vertex-set of GG such that the sizes of any two parts differ by at most one. We show that every graph with an acyclic coloring with at most kk colors can be equitably partitioned into k1k-1 induced forests. We also prove that for any integers d1d\ge 1 and k3d1k\ge 3^{d-1}, any dd-degenerate graph can be equitably partitioned into kk induced forests. Each of these results implies the existence of a constant cc such that for any kck \ge c, any planar graph has an equitable partition into kk induced forests. This was conjectured by Wu, Zhang, and Li in 2013.Comment: 4 pages, final versio

    Distance-two coloring of sparse graphs

    Full text link
    Consider a graph G=(V,E)G = (V, E) and, for each vertex vVv \in V, a subset Σ(v)\Sigma(v) of neighbors of vv. A Σ\Sigma-coloring is a coloring of the elements of VV so that vertices appearing together in some Σ(v)\Sigma(v) receive pairwise distinct colors. An obvious lower bound for the minimum number of colors in such a coloring is the maximum size of a set Σ(v)\Sigma(v), denoted by ρ(Σ)\rho(\Sigma). In this paper we study graph classes FF for which there is a function ff, such that for any graph GFG \in F and any Σ\Sigma, there is a Σ\Sigma-coloring using at most f(ρ(Σ))f(\rho(\Sigma)) colors. It is proved that if such a function exists for a class FF, then ff can be taken to be a linear function. It is also shown that such classes are precisely the classes having bounded star chromatic number. We also investigate the list version and the clique version of this problem, and relate the existence of functions bounding those parameters to the recently introduced concepts of classes of bounded expansion and nowhere-dense classes.Comment: 13 pages - revised versio

    On First-Order Definable Colorings

    Full text link
    We address the problem of characterizing HH-coloring problems that are first-order definable on a fixed class of relational structures. In this context, we give several characterizations of a homomorphism dualities arising in a class of structure
    corecore