144 research outputs found

    A survey on algorithmic aspects of modular decomposition

    Full text link
    The modular decomposition is a technique that applies but is not restricted to graphs. The notion of module naturally appears in the proofs of many graph theoretical theorems. Computing the modular decomposition tree is an important preprocessing step to solve a large number of combinatorial optimization problems. Since the first polynomial time algorithm in the early 70's, the algorithmic of the modular decomposition has known an important development. This paper survey the ideas and techniques that arose from this line of research

    Defective Coloring on Classes of Perfect Graphs

    Full text link
    In Defective Coloring we are given a graph GG and two integers χd\chi_d, Δ∗\Delta^* and are asked if we can χd\chi_d-color GG so that the maximum degree induced by any color class is at most Δ∗\Delta^*. We show that this natural generalization of Coloring is much harder on several basic graph classes. In particular, we show that it is NP-hard on split graphs, even when one of the two parameters χd\chi_d, Δ∗\Delta^* is set to the smallest possible fixed value that does not trivialize the problem (χd=2\chi_d = 2 or Δ∗=1\Delta^* = 1). Together with a simple treewidth-based DP algorithm this completely determines the complexity of the problem also on chordal graphs. We then consider the case of cographs and show that, somewhat surprisingly, Defective Coloring turns out to be one of the few natural problems which are NP-hard on this class. We complement this negative result by showing that Defective Coloring is in P for cographs if either χd\chi_d or Δ∗\Delta^* is fixed; that it is in P for trivially perfect graphs; and that it admits a sub-exponential time algorithm for cographs when both χd\chi_d and Δ∗\Delta^* are unbounded

    Some results on triangle partitions

    Full text link
    We show that there exist efficient algorithms for the triangle packing problem in colored permutation graphs, complete multipartite graphs, distance-hereditary graphs, k-modular permutation graphs and complements of k-partite graphs (when k is fixed). We show that there is an efficient algorithm for C_4-packing on bipartite permutation graphs and we show that C_4-packing on bipartite graphs is NP-complete. We characterize the cobipartite graphs that have a triangle partition

    Partitioning Perfect Graphs into Stars

    Full text link
    The partition of graphs into "nice" subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into same-size stars, a problem known to be NP-complete even for the case of stars on three vertices. We perform a thorough computational complexity study of the problem on subclasses of perfect graphs and identify several polynomial-time solvable cases, for example, on interval graphs and bipartite permutation graphs, and also NP-complete cases, for example, on grid graphs and chordal graphs.Comment: Manuscript accepted to Journal of Graph Theor
    • …
    corecore