2013/03/18 by Mateus de Oliveira Oliveira, Oliveira, Mateus de Oliveira
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph theory and applications #Logic in Computer Science (cs.LO) #cs.CC #cs.DM #cs.LO #math.CO
paper · pdf · doi:10.48550/arxiv.1303.4443
12 pages body, 11 pages of references + appendix + 3 figures
openalex publication_date 2013/03/18 · arxiv created 2013/06/17 · arxiv updated 2013/06/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We introduce the notion of z-topological orderings for digraphs. We prove that given a digraph G on n vertices admitting a z-topological order- ing, together with such an ordering, one may count the number of subgraphs of G that at the same time satisfy a monadic second order formula ϕ and are the union of k directed paths, in time f (ϕ, k, z) * nO(k*z) . Our result implies the polynomial time solvability of many natural counting problems on digraphs admitting z-topological orderings for constant values of z and k. Concerning the relationship between z-topological orderability and other digraph width measures, we observe that any digraph of directed path-width d has a z- topological ordering for z <= 2d + 1. On the other hand, there are digraphs on n vertices admitting a z-topological order for z = 2, but whose directed path-width is Θ(log n). Since graphs of bounded directed path-width can have both arbitrarily large undirected tree-width and arbitrarily large clique width, our result provides for the first time a suitable way of partially trans- posing metatheorems developed in the context of the monadic second order logic of graphs of constant undirected tree-width and constant clique width to the realm of digraph width measures that are closed under taking subgraphs and whose constant levels incorporate families of graphs of arbitrarily large undirected tree-width and arbitrarily large clique width.