308,658 research outputs found

    Rainbow domination and related problems on some classes of perfect graphs

    Full text link
    Let kNk \in \mathbb{N} and let GG be a graph. A function f:V(G)2[k]f: V(G) \rightarrow 2^{[k]} is a rainbow function if, for every vertex xx with f(x)=f(x)=\emptyset, f(N(x))=[k]f(N(x)) =[k]. The rainbow domination number γkr(G)\gamma_{kr}(G) is the minimum of xV(G)f(x)\sum_{x \in V(G)} |f(x)| over all rainbow functions. We investigate the rainbow domination problem for some classes of perfect graphs

    Between Treewidth and Clique-width

    Full text link
    Many hard graph problems can be solved efficiently when restricted to graphs of bounded treewidth, and more generally to graphs of bounded clique-width. But there is a price to be paid for this generality, exemplified by the four problems MaxCut, Graph Coloring, Hamiltonian Cycle and Edge Dominating Set that are all FPT parameterized by treewidth but none of which can be FPT parameterized by clique-width unless FPT = W[1], as shown by Fomin et al [7, 8]. We therefore seek a structural graph parameter that shares some of the generality of clique-width without paying this price. Based on splits, branch decompositions and the work of Vatshelle [18] on Maximum Matching-width, we consider the graph parameter sm-width which lies between treewidth and clique-width. Some graph classes of unbounded treewidth, like distance-hereditary graphs, have bounded sm-width. We show that MaxCut, Graph Coloring, Hamiltonian Cycle and Edge Dominating Set are all FPT parameterized by sm-width

    Recent trends and future directions in vertex-transitive graphs

    Get PDF
    A graph is said to be vertex-transitive if its automorphism group acts transitively on the vertex set. Some recent developments and possible future directions regarding two famous open problems, asking about existence of Hamilton paths and existence of semiregular automorphisms in vertex-transitive graphs, are discussed, together with some recent results on arc-transitive graphs and half-arc-transitive graphs, two special classes of vertex-transitive graphs that have received particular attention over the last decade
    corecore