Related papers: Excluding the fork and antifork
Entanglement is a complexity measure of digraphs that origins in fixed-point logics. Its combinatorial purpose is to measure the nested depth of cycles in digraphs. We address the problem of characterizing the structure of graphs of…
We introduce the factorization graph of a finite group and study its connectedness and forbidden structures. We characterize all finite groups with connected factorization graphs and classify those with connected bipartite factorization…
In this paper we show that every finite spatial graph is a connected sum of a planar graph, which is a forest, i.e. disjoint union of finite number of trees and a tangle. As a consequence we get that any finite spatial graph is a connected…
The tree of decomposition of a $k$-connected graph by a set $\mathfrak S$ of pairwise independent $k$-vertex cutsets is defined as follows. The vertices of this tree are cutsets of $\mathfrak S$ and parts of decomposition of the graph by…
A graph in which all minimal zero forcing sets are in fact minimum size is called ``well-forced." This paper characterizes well-forced trees and presents an algorithm for determining which trees are well-forced. Additionally, we…
We present exact and heuristic algorithms that find, for a given family of graphs, a graph that contains each member of the family as an induced subgraph. For $0 \leq k \leq 6$, we give the minimum number of vertices $f(k)$ in a graph…
An edge in a $k$-connected graph $G$ is called {\em $k$-contractible} if the graph $G/e$ obtained from $G$ by contracting $e$ is $k$-connected. Generalizing earlier results on $3$-contractible edges in spanning trees of $3$-connected…
Gy\'arf\'as and Sumner independently conjectured that for every tree $T$, the class of graphs not containing $T$ as an induced subgraph is $\chi$-bounded, that is, the chromatic numbers of graphs in this class are bounded above by a…
A string graph is an intersection graph of curves in the plane. A $k$-string graph is a graph with a string representation in which every pair of curves intersects in at most $k$ points. We introduce the class of $(=k)$-string graphs as a…
An antimagic labeling of a graph $G(V,E)$ is a bijection $f: E \to \{1,2, \dots, |E|\}$ so that $\sum_{e \in E(u)} f(e) \neq \sum_{e \in E(v)} f(e)$ holds for all $u, v \in V(G)$ with $u \neq v$, where $E(v)$ is the set of edges incident to…
Let $k,l$ be two positive integers. An $S_{k,l}$ is a graph obtained from disjoint $K_{1,k}$ and $K_{1,l}$ by adding an edge between the $k$-degree vertex in $K_{1,k}$ and the $l$-degree vertex in $K_{1,l}$. An {\em $S_{k,l}$-free} graph is…
A graph is a path graph if it is the intersection graph of a family of subpaths of a tree. In 1970, Renz asked for a characterizaton of path graphs by forbidden induced subgraphs. Here we answer this question by listing all graphs that are…
A graph $\textit{G}$ is a tuple $(\textit{V}, \textit{E})$, where $\textit{V}$ is the vertex set, $\textit{E}$ is the edge set. A reduced graph is a graph of deleting non-Hamiltonian edges and smoothing out the redundant vertices of degree…
We define an algorithm k which takes a connected graph G on a totally ordered vertex set and returns an increasing tree R (which is not necessarily a subtree of G). We characterize the set of graphs G such that k(G)=R. Because this set has…
This paper is motivated by the following question: what are the unavoidable induced subgraphs of graphs with large treewidth? Aboulker et al. made a conjecture which answers this question in graphs of bounded maximum degree, asserting that…
A tree $T$ in an edge-colored graph is called a {\it proper tree} if no two adjacent edges of $T$ receive the same color. Let $G$ be a connected graph of order $n$ and $k$ be an integer with $2\leq k \leq n$. For $S\subseteq V(G)$ and $|S|…
The proper thinness of a graph is an invariant that generalizes the concept of a proper interval graph. Every graph has a numerical value of proper thinness and the graphs with proper thinness~1 are exactly the proper interval graphs. A…
A {\em theta} is a graph made of three internally vertex-disjoint chordless paths $P_1 = a \dots b$, $P_2 = a \dots b$, $P_3 = a \dots b$ of length at least~2 and such that no edges exist between the paths except the three edges incident to…
For every graph $X$, we consider the class of all connected $\{K_{1,3}, X\}$-free graphs which are distinct from an odd cycle and have independence number at least $4$, and we show that all graphs in the class are perfect if and only if $X$…
It is proved that the restriction of a $k$ and $(k-1)$-component directed spanning forest of minimal weight to an atom of the subset algebra generated by the sets of vertices of trees of $k$-component minimal spanning forests is a tree. For…