Results 11 to 20 of about 51 (49)
Cycle decompositions of pathwidth‐6 graphs
Journal of Graph Theory, Volume 94, Issue 2, Page 224-251, June 2020., 2020 Abstract Hajós' conjecture asserts that a simple Eulerian graph on n vertices can be decomposed into at most ⌊ ( n − 1 ) / 2 ⌋ cycles. The conjecture is only proved for graph classes in which every element contains vertices of degree 2 or 4. We develop new techniques to construct cycle decompositions.
Elke Fuchs +2 more
wiley +1 more source
On edge-intersection graphs of k-bend paths in grids [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Edge-intersection graphs of paths in grids are graphs that can be represented such that vertices are paths in a grid and edges between vertices of the graph exist whenever two grid paths share a grid edge. This type of graphs is motivated by applications
Therese Biedl, Michal Stern
doaj +1 more source
The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 For some time the discrete strategy improvement algorithm due to Jurdzinski and Voge had been considered as a candidate for solving parity games in polynomial time.
Felix Canavoi +2 more
doaj +1 more source
On the treewidth of triangulated 3-manifolds
Journal of Computational Geometry, 2019 In graph theory, as well as in 3-manifold topology, there exist several width-type parameters to describe how "simple" or "thin" a given graph or 3-manifold is.
Kristóf Huszár +2 more
doaj +1 more source
The Pebble-Relation Comonad in Finite Model Theory [PDF]
Logical Methods in Computer ScienceThe pebbling comonad, introduced by Abramsky, Dawar and Wang, provides a categorical interpretation for the k-pebble games from finite model theory.
Yoàv Montacute, Nihil Shah
doaj +1 more source
Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries [PDF]
Logical Methods in Computer ScienceWe show that the problem of whether a query is equivalent to a query of tree-width $k$ is decidable, for the class of Unions of Conjunctive Regular Path Queries with two-way navigation (UC2RPQs).
Diego Figueira, Rémi Morvan
doaj +1 more source
On the Complexity of Embedding in Graph Products
Computing in Geometry and TopologyGraph embedding, especially as a subgraph of a grid, is an old topic in VLSI design and graph drawing. In this paper, we investigate related questions concerning the complexity of embedding a graph G in a host graph that is the strong product of a path ...
Therese Biedl +2 more
doaj +1 more source
Pathwidth of 2-Layer k-Planar Graphs
Computing in Geometry and TopologyA bipartite graph G = (X ∪ Y, E) is a 2-layer k-planar graph if it admits a drawing on the plane such that the vertices in X and Y are placed on two parallel lines respectively, edges are drawn as straight-line segments, and every edge involves at most ...
Yuto Okada
doaj +1 more source
On first-order transductions of classes of graphs [PDF]
Logical Methods in Computer ScienceWe study various aspects of the first-order transduction quasi-order on graph classes, which provides a way of measuring the relative complexity of graph classes based on whether one can encode the other using a formula of first-order (FO) logic.
Samuel Braunfeld +3 more
doaj +1 more source
Discrete Mathematics & Theoretical Computer ScienceNot every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyond planarity by considering upward $k$-planar drawings of DAGs in which the
Patrizio Angelini +10 more
doaj +1 more source