相关论文: Contractible edges in 3-connected graphs that pres…

An edge $e$ of a graph $G$ is called deletable for some orientation $o$ if the restriction of $o$ to $G-e$ is a strong orientation. Inspired by a problem of Frank, in 2021 H\"orsch and Szigeti proposed a new parameter for $3$-edge-connected…

A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. We prove a conjecture of McDiarmid, Steger, and Welsh, that says that…

A long-standing conjecture of Thomassen says that every longest cycle of a $3$-connected graph has a chord. Thomassen (2018) proved that if $G$ is a $2$-connected cubic graph, then any longest cycle must have a chord. He also showed that in…

We consider the connectivity of fiber graphs with respect to Gr\"obner basis and Graver basis moves. First, we present a sequence of fiber graphs using moves from a Gr\"obner basis and prove that their edge-connectivity is lowest possible…

A graph on at least ${{k+1}}$ vertices is uniformly $k$-connected if each pair of its vertices is connected by $k$ and not more than $k$ independent paths. We reinvestigate a recent constructive characterization of uniformly $3$-connected…

Let $G$ be a connected graph and $L(G)$ the set of all integers $k$ such that $G$ contains a spanning tree with exactly $k$ leaves. We show that for a connected graph $G$, the set $L(G)$ is contiguous. It follows from work of Chen, Ren, and…

For a simple graph $G$, the $3$-distance graph, $D_3(G)$, is a graph with the vertex set $V(G)$ and two vertices are adjacent if and only if their distance is $3$ in the graph $G$. For a connected graph $G$, we provide some conditions for…

A tree $T$ in an edge-colored graph is 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 a fixed integer with $2\le k\le n$. For a vertex subset $S \subseteq…

A graph $G$ is $\{F_{1}, F_{2},\dots,F_{k}\}$-free if $G$ contains no induced subgraph isomorphic to any $F_{i}$ $(1\leq i \leq k)$. A connected graph $G$ is a split graph if its vertex set can be partitioned into a clique and an…

The conditional $h$-vertex($h$-edge) connectivity of a connected graph $H$ of minimum degree $ k > h$ is the size of a smallest vertex(edge) set $F$ of $H$ such that $H - F$ is a disconnected graph of minimum degree at least $h.$ Let $G$ be…

Let $F(G)$ be the number of forests of a graph $G$. Similarly let $C(G)$ be the number of connected spanning subgraphs of a connected graph $G$. We bound $F(G)$ and $C(G)$ for regular graphs and for graphs with fixed average degree. Among…

A graph G is weakly 4-connected if it is 3-connected, has at least five vertices, and for every pair of sets (A,B) with union V(G) and intersection of size three such that no edge has one end in A-B and the other in B-A, one of the induced…

We study graphs where each edge adjacent to a vertex of small degree (7 and 9, respectively) belongs to many triangles (4 and 5, respectively) and show that these graphs contain a complete graph (K_6 and K_7, respectively) as a minor. The…

For a connected graph, a {\em minimum vertex separator} is a minimum set of vertices whose removal creates at least two connected components. The vertex connectivity of the graph refers to the size of the minimum vertex separator and a…

Dirac and Lov\'{a}sz independently characterized the $3$-connected graphs with no pair of vertex-disjoint cycles. Equivalently, they characterized all $3$-connected graphs with no prism-minors. In this paper, we completely characterize the…

In an orientation $O$ of the graph $G$, an arc $e$ is deletable if and only if $O-e$ is strongly connected. For a $3$-edge-connected graph $G$, the Frank number is the minimum $k$ for which $G$ admits $k$ strongly connected orientations…

Let $\mathcal{G}$ be the set of simple graphs (or multigraphs) $G$ such that for each $G \in \mathcal{G}$ there exists at least two non-empty disjoint proper subsets $V_{1},V_{2}\subseteq V(G)$ satisfying $V(G)\setminus(V_{1} \cup…

A tree with at most k leaves is called k-ended tree, and a tree with exactly k leaves is called k-end tree, where a leaf is a vertex of degree one. Contraction of a graph G along the edge e means deleting the edge e and identifying its end…

A graph $G$ is called equiarboreal if the number of spanning trees containing a given edge in $G$ is independent of the choice of edge. In [Combinatorica 1(2) (1981) 163--167], Godsil proved that any graph which is a colour class in an…

We prove that every connected graph $G$ with $m$ edges contains a set $X$ of at most $\frac{3}{16}(m + 1)$ vertices such that $G-X$ has no $K_4$ minor, or equivalently, has treewidth at most $2$. This bound is best possible. Connectivity is…