Related papers: B1-EPG representations using block-cutpoint trees
The discovery and analysis of network patterns are central to the scientific enterprise. In the present work, we developed and evaluated a new approach that learns the building blocks of graphs that can be used to understand and generate…
Many authors have investigated edge decompositions of graphs by the edge sets of isomorphic copies of special subgraphs. For $q$- dimensional hypercubes $Q_q$ various researchers have done this for cer- tain trees, paths, and cycles. In…
A graph $G=(V,E)$ is a geometric intersection graph if every node $v \in V$ is identified with a geometric object of some particular type, and two nodes are adjacent if the corresponding objects intersect. Geometric intersection graph…
A \textit{$t$-unit-bar representation} of a graph $G$ is an assignment of sets of at most $t$ horizontal unit-length segments in the plane to the vertices of $G$ so that (1) all of the segments are pairwise nonintersecting, and (2) two…
In this article, we give two extended space formulations, respectively, for the induced tree and path polytopes of chordal graphs with vertex and edge variables. These formulations are obtained by proving that the induced tree and path…
The GC problem is to identify a pre-determined number of center vertices such that the distances or costs from (or to) the centers to (or from) other vertices is minimized. The bottleneck of a path is the minimum capacity of edges on the…
An edge cut $C$ of a graph $G$ is {\it tight} if $|C \cap M|=1$ for every perfect matching $M$ of $G$.~Barrier cuts and 2-separation cuts are called {\it ELP-cuts}, which are two important types of tight cuts in matching covered…
In traffic forecasting, graph convolutional networks (GCNs), which model traffic flows as spatio-temporal graphs, have achieved remarkable performance. However, existing GCN-based methods heuristically define the graph structure as the…
In 2021 Baudier, Motakis, Schlumprecht, and Zs\'ak proved that if a sequence of graphs $(G_k)_{k\in{\mathbb{N}}}$ contains the sequence of complete graphs with uniformly bounded distortion, then the sequence of lamplighter graphs on $G_k$'s…
For any fixed graph $G$, the subgraph isomorphism problem asks whether an $n$-vertex input graph has a subgraph isomorphic to $G$. A well-known algorithm of Alon, Yuster and Zwick (1995) efficiently reduces this to the "colored" version of…
The aim of this chapter is to provide an adequate graph theoretic framework for the description of periodic bifurcations which have recently been discovered in descendant trees of finite p-groups. The graph theoretic concepts of rooted…
A graph $G$ is called $B_k$-VPG, for some constant $k\geq 0$, if it has a string representation on an axis-parallel grid such that each vertex is a path with at most $k$ bends and two vertices are adjacent in $G$ if and only if the…
In this paper we count all the subpaths of a given graph G; including the subpaths of length zero, and we call this quantity the subpath number of G. The subpath number is related to the extensively studied number of subtrees, as it can be…
The \textit{longest path transversal number} of a connected graph $G$, denoted by $lpt(G)$, is the minimum size of a set of vertices of $G$ that intersects all longest paths in $G$. We present constant upper bounds for the longest path…
We investigate the parameterized complexity of the recognition problem for the proper $H$-graphs. The $H$-graphs are the intersection graphs of connected subgraphs of a subdivision of a multigraph $H$, and the properness means that the…
Graph Transformers (GTs) facilitate the comprehension of graph-structured data by calculating the self-attention of node pairs without considering node position information. To address this limitation, we introduce an innovative and…
Point-set embeddings and large-angle crossings are two areas of graph drawing that independently have received a lot of attention in the past few years. In this paper, we consider problems in the intersection of these two areas. Given the…
Many networks, such as transportation, power, and water distribution, can be represented as graphs. Crucial challenge in graph representations is identifying the importance of graph edges and their influence on overall network efficiency…
Let $lct(G)$ be the minimum cardinality of a set of vertices that intersects every longest cycle of a 2-connected graph $G$. We show that $lct(G)\leq k-1$ if $G$ is a partial $k$-tree and that $lct(G)\leq \max \{1, {\omega(G){-}3}\}$ if $G$…
In this paper, we disprove the long-standing conjecture that any complete geometric graph on $2n$ vertices can be partitioned into $n$ plane spanning trees. Our construction is based on so-called bumpy wheel sets. We fully characterize…