scientific article; zbMATH DE number 1478125

Andrzej Ehrenfeucht, Tero J.Harju, Grzegorz Rozenberg

Publication date: 17 July 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

theory of 2-structures decomposition and transformation of graphs

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (58)

Existential MSO over two successors is strictly weaker than over linear orders ⋮ Decomposing simple permutations, with enumerative consequences ⋮ Definable transductions and weighted logics for texts ⋮ An Analytic Propositional Proof System on Graphs ⋮ The $\{-2,-1\}$-selfdual and decomposable tournaments ⋮ The idiosyncratic polynomial of digraphs ⋮ Finite metrics in switching classes ⋮ The rank-width of edge-coloured graphs ⋮ Description of the tournaments which are reconstructible from their $k$-cycle partial digraphs for $k\in \{3, 4\}$ ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A matrix description of weakly bipartitive and bipartitive families ⋮ Join-irreducible Boolean functions ⋮ Complete edge-colored permutation graphs ⋮ On scattered convex geometries ⋮ Pairs of orthogonal countable ordinals ⋮ Decomposition tree of a lexicographic product of binary structures ⋮ Nash equilibria and values through modular partitions in infinite games ⋮ Birecognition of prime graphs, and minimal prime graphs ⋮ Tree-representation of set families and applications to combinatorial decompositions ⋮ PC trees and circular-ones arrangements. ⋮ Primality, criticality and minimality problems in trees ⋮ On switching classes, NLC-width, cliquewidth and treewidth ⋮ Lexicographic products with high reconstruction numbers ⋮ Prechains and self duality ⋮ $(\leq k)$-reconstructible binary relations ⋮ A survey of the algorithmic aspects of modular decomposition ⋮ Transitivity of local complementation and switching on graphs. ⋮ Recognition of prime graphs from a prime subgraph ⋮ Critically twin primitive 2-structures ⋮ Prime orientable graphs ⋮ Criticality of switching classes of reversible 2-structures labeled by an abelian group ⋮ Finite orders which are reconstructible up to duality by their comparability graphs ⋮ $\mathbb F$ -Rank-Width of (Edge-Colored) Graphs ⋮ T-structures, T-functions, and texts ⋮ Countable linear orders with disjoint infinite intervals are mutually orthogonal ⋮ A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product ⋮ The modular decomposition of countable graphs. Definition and construction in monadic second-order logic ⋮ The morphology of infinite tournaments; application to the growth of their profile ⋮ GETGRATS ⋮ Embedding linear orders in grids ⋮ The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations ⋮ Recognizability, hypergraph operations, and logical types ⋮ Complementation, local complementation, and switching in binary matroids ⋮ Ultracritical and hypercritical binary structures ⋮ Critically indecomposable graphs ⋮ Indecomposable tournaments and their indecomposable subtournaments with six vertices ⋮ A Representation Theorem for Union-Difference Families and Application ⋮ Enumerating submultisets of multisets ⋮ Prime 3-uniform hypergraphs ⋮ Orthogonal countable linear orders ⋮ From modular decomposition trees to rooted median graphs ⋮ Unnamed Item ⋮ Interval orders, semiorders and ordered groups ⋮ A type of algebraic structure related to sets of intervals ⋮ Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic ⋮ Critical 3-hypergraphs ⋮ 3-uniform hypergraphs: modular decomposition and realization by tournaments

This page was built for publication: