Hanna Furmańczyk ; Vahan Mkrtchyan - Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs

dmtcs:6860 - Discrete Mathematics & Theoretical Computer Science, November 30, 2022, vol. 23 no. 2, special issue in honour of Maurice Pouzet - https://doi.org/10.46298/dmtcs.6860
Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphsArticle

Authors: Hanna Furmańczyk ; Vahan Mkrtchyan

    An equitable coloring of a graph $G=(V,E)$ is a (proper) vertex-coloring of $G$, such that the sizes of any two color classes differ by at most one. In this paper, we consider the equitable coloring problem in block graphs. Recall that the latter are graphs in which each 2-connected component is a complete graph. The problem remains hard in the class of block graphs. In this paper, we present some graph theoretic results relating various parameters. Then we use them in order to trace some algorithmic implications, mainly dealing with the fixed-parameter tractability of the problem.

    https://doi.org/10.46298/dmtcs.6860
    Source: arXiv.org:2009.12784
    Volume: vol. 23 no. 2, special issue in honour of Maurice Pouzet
    Section: Special issues
    Published on: November 30, 2022
    Accepted on: October 15, 2022
    Submitted on: October 27, 2020
    Keywords: Computer Science - Discrete Mathematics,Mathematics - Combinatorics,05C15, 05C85, 68R10
    Licence: arXiv.org - Non-exclusive license to distribute

    Share and export

    Consultation statistics

    This page has been seen 469 times.
    This article's PDF has been downloaded 334 times.