相关论文: Tree Diagrams for String Links

Target class classification is a mixed classification and transition model whose integrated goal is to assign objects to a certain, so called target or normal class. The classification process is iterative, and in each step an object in a…

Tree alignment graphs (TAGs) provide an intuitive data structure for storing phylogenetic trees that exhibits the relationships of the individual input trees and can potentially account for nested taxonomic relationships. This paper…

Attack trees and attack graphs are both common graphical threat models used by organizations to better understand possible cybersecurity threats. These models have been primarily seen as separate entities, to be used and researched in…

Let $T$ be a tree. A vertex of degree one is a \emph{leaf} of $T$ and a vertex of degree at least three is a \emph{branch vertex} of $T$. A graph is said to be claw-free if it does not contain $K_{1,3}$ as an induced subgraph. In this…

A graph is chordal if it contains no induced cycle of length four or more. While finite chordal graphs are precisely those admitting tree-decompositions into cliques, this fails for infinite graphs. We establish two results extending the…

Hasunuma [J. Graph Theory 102 (2023) 423-435] conjectured that for any tree $T$ of order $m$, every $k$-connected (or $k$-edge-connected) graph $G$ with minimum degree at least $k+m-1$ contains a tree $T'\cong T$ such that $G-E(T')$ is…

In this paper we present a characterisation, by an infinite family of minimal forbidden induced subgraphs, of proper circular arc graphs which are intersection graphs of paths on a grid, where each path has at most one bend (turn).

Let $\mathcal T_n$ denote the set of all labelled spanning trees of $K_n$. A family $\mathcal F \subset \mathcal T_n$ is $t$-intersecting if for all $A, B \in \mathcal F$ the trees $A$ and $B$ share at least $t$ edges. In this paper, we…

We define a special case of tree decompositions for planar graphs that respect a given embedding of the graph. We study the analogous width of the resulting decomposition we call the embedded-width of a plane graph. We show both upper…

It is known that every graph with n vertices embeds stochastically into trees with distortion $O(\log n)$. In this paper, we show that this upper bound is sharp for a large class of graphs. As this class of graphs contains diamond graphs,…

We study the design of efficient algorithms for combinatorial pattern matching. More concretely, we study algorithms for tree matching, string matching, and string matching in compressed texts.

We give exact formulas for the transmission (i.e. the sum of all distances between vertices) of perfect trees and rooted powers of (connected finite) graphs.

We characterize the compatibility of a collection of unrooted phylogenetic trees as a question of determining whether a graph derived from these trees --- the display graph --- has a specific kind of triangulation, which we call legal. Our…

We generalise structure tree theory, which is based on removing finitely many edges, to removing finitely many vertices. This gives a significant generalization of Tutte's tree decomposition of 2-connected graphs into 3-connected blocks.…

We investigate the connections between tree amalgamations and quasi-isometries. In particular, we prove that the quasi-isometry type of multi-ended accessible quasi-transitive connected locally finite graphs is determined by the…

This paper explores the kinds of probabilistic relations that are important in syntactic disambiguation. It proposes that two widely used kinds of relations, lexical dependencies and structural relations, have complementary disambiguation…

In this paper, we give a complete set of finite type string link invariants of degree <5. In addition to Milnor invariants, these include several string link invariants constructed by evaluating knot invariants on certain closure of…

A link diagram can be considered as a $4$-valent graph embedded in the $2$-sphere and divides the sphere into complementary regions. In this paper, we show that any link has a diagram with only triangles and quadrilaterals. This extends…

We describe various path homology theories constructed for a directed hypergraph. We introduce the category of directed hypergraphs and the notion of a homotopy in this category. Also, we investigate the functoriality and the homotopy…

Let G = (V, E) be a finite simple connected graph. We say a graph G realizes a code of the type 0^s_1 1^t_1 0^s_2 1^t_2 ... 0^s_k1^t_k if and only if G can obtained from the code by some rule. Some classes of graphs such as threshold and…