相关论文: Finding Maximal Sets of Laminar 3-Separators in Pl…

The planar separator theorem by Lipton and Tarjan [FOCS '77, SIAM Journal on Applied Mathematics '79] states that any planar graph with $n$ vertices has a balanced separator of size $O(\sqrt{n})$ that can be found in linear time. This…

We prove that for a connected simple graph $G$ with $n\le 10$ vertices, and two longest paths $C$ and $D$ in $G$, the intersection of vertex sets $V(C)\cap V(D)$ is a separator. This shows that the graph found previously with $n=11$, in…

In this work, we present the first linear time deterministic algorithm computing the 4-edge-connected components of an undirected graph. First, we show an algorithm listing all 3-edge-cuts in a given 3-edge-connected graph, and then we use…

Considering systems of separations in a graph that separate every pair of a given set of vertex sets that are themselves not separated by these separations, we determine conditions under which such a separation system contains a nested…

A graph with n vertices is 1-planar if it can be drawn in the plane such that each edge is crossed at most once, and is optimal if it has the maximum of 4n-8 edges. We show that optimal 1-planar graphs can be recognized in linear time. Our…

We consider the Max-$3$-Section problem, where we are given an undirected graph $ G=(V,E)$ equipped with non-negative edge weights $w :E\rightarrow \mathbb{R}_+$ and the goal is to find a partition of $V$ into three equisized parts while…

A decomposition of a graph is a set of subgraphs whose edges partition those of $G$. The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected cubic graph can be decomposed into a spanning tree, a…

A detachment of a hypergraph $\scr F$ is a hypergraph obtained from $\scr F$ by splitting some or all of its vertices into more than one vertex. Amalgamating a hypergraph $\scr G$ can be thought of as taking $\scr G$, partitioning its…

One of the most basic techniques in algorithm design consists of breaking a problem into subproblems and then proceeding recursively. In the case of graph algorithms, one way to implement this approach is through separator sets. Given a…

Every $n$-vertex planar triangle-free graph with maximum degree at most $3$ has an independent set of size at least $\frac{3}{8}n$. This was first conjectured by Albertson, Bollob\'as and Tucker, and was later proved by Heckman and Thomas.…

A graph is $1$-planar if it has a drawing in the plane such that each edge is crossed at most once by another edge. Moreover, if this drawing has the additional property that for each crossing of two edges the end vertices of these edges…

Let $G=(V(G), E(G))$ be an undirected graph with a measure function $\mu$ assigning non-negative values to subgraphs $H$ so that $\mu(H)$ does not exceed the clique cover number of $H$. When $\mu$ satisfies some additional natural…

introduce {\sc Planar Disjoint Paths Completion}, a completion counterpart of the Disjoint Paths problem, and study its parameterized complexity. The problem can be stated as follows: given a, not necessarily connected, plane graph $G,$ $k$…

We prove that if $G$ is a graph and $r_1, ..., r_k \in \mathbb{Z}_{\geq 0}$ such that $\sum_{i=1}^k r_i \geq \Delta(G) + 2 - k$ then $V(G)$ can be partitioned into sets $V_1, ..., V_k$ such that $\Delta(G[V_i]) \leq r_i$ and $G[V_i]$…

A separating path system for a graph $G$ is a collection $\mathcal{P}$ of paths in $G$ such that for every two edges $e$ and $f$ in $G$, there is a path in $\mathcal{P}$ that contains $e$ but not $f$. We show that every $n$-vertex graph has…

In this paper, we study collective additive tree spanners for families of graphs enjoying special Robertson-Seymour's tree-decompositions, and demonstrate interesting consequences of obtained results. We say that a graph $G$ {\em admits a…

Given a graph $G=(V, E)$, a connected sides cut $(U, V\backslash U)$ or $\delta (U)$ is the set of edges of E linking all vertices of U to all vertices of $V\backslash U$ such that the induced subgraphs $G[U]$ and $G[V\backslash U]$ are…

The "separation dimension" of a graph $G$ is the minimum positive integer $d$ for which there is an embedding of $G$ into $\mathbb{R}^d$, such that every pair of disjoint edges are separated by some axis-parallel hyperplane. We prove a…

We study temporal analogues of the Unrestricted Vertex Separator problem from the static world. An $(s,z)$-temporal separator is a set of vertices whose removal disconnects vertex $s$ from vertex $z$ for every time step in a temporal graph.…

The {\sc $c$-Balanced Separator} problem is a graph-partitioning problem in which given a graph $G$, one aims to find a cut of minimum size such that both the sides of the cut have at least $cn$ vertices. In this paper, we present new…