相关论文: Tait's Flyping Conjecture for 4-Regular Graphs

In 2019, P. Higgins formulated [1] a question about bipartite graphs (see Conjecture 1 below); this question arises in the study of regular finite semigroups. F. V. Petrov formulated [2] another combinatorial conjecture (Conjecture 3);…

In this paper, we show that the $\theta$-graph with three cones is connected. We also provide an alternative proof of the connectivity of the Yao graph with three cones.

A cyclic coloring of a plane graph $G$ is a coloring of its vertices such that vertices incident with the same face have distinct colors. The minimum number of colors in a cyclic coloring of a plane graph $G$ is its cyclic chromatic number…

We introduce, for every surface {\Sigma}, a two-way connection between FO transductions (first-order logical transformations) of the graphs embeddable in {\Sigma} and a certain variant of fan-crossing drawings of graphs in {\Sigma}. If the…

The vertex connectivity of a graph $G$ is the size of the smallest set of vertices $S$ such that $G \setminus S$ is disconnected. For the class of planar graphs, the problem of vertex connectivity is well-studied, both from structural and…

Let $P$ be a set of $n\geq 3$ points in general position in the plane. The edge disjointness graph $D(P)$ of $P$ is the graph whose vertices are all the closed straight line segments with endpoints in $P$, two of which are adjacent in…

A famous conjecture by Itai and Zehavi states that, for every $d$-vertex-connected graph $G$ and every vertex $r$ in $G$, there are $d$ spanning trees of $G$ such that, for every vertex $v$ in $G\setminus \{r\}$, the paths between $r$ and…

We prove that any \(2\)-connected graph \(G\) on \(n\) vertices with minimum degree \(\delta(G) \ge \frac{n}{4}+2\) contains a \(2\)-connected subgraph of order \(k\) for every integer \(k\) with \(4 \le k \le n\). This improves a previous…

The topological Tverberg theorem has been generalized in several directions by setting extra restrictions on the Tverberg partitions. Restricted Tverberg partitions, defined by the idea that certain points cannot be in the same part, are…

A nut graph is a simple graph whose adjacency matrix has the eigenvalue~0 with multiplicity~1 such that its corresponding eigenvector has no zero entries. Motivated by a question of Fowler et al.~[\emph{Disc. Math. Graph Theory} 40 (2020),…

In this paper, we present a minimal counterexample to a conjecture of Perles that answers a question of Haase and Ziegler. The example is a simple 4-polytope that has an induced 3-connected 3-regular subgraph, whose graph complement is…

Hoffmann-Ostenhof's Conjecture states that the edge set of every connected cubic graph can be decomposed into a spanning tree, a matching and a $2$-regular subgraph. In this paper, we show that the conjecture holds for claw-free subcubic…

We adapt the classical 3-decomposition of any 2-connected graph to the case of simple graphs (no loops or multiple edges). By analogy with the block-cutpoint tree of a connected graph, we deduce from this decomposition a bicolored tree…

In 2006, Barat and Thomassen conjectured in 2006 that the edges of every planar 4-regular 4-edge-connected graph can be decomposed into copies of the star with 3 leaves. Shortly afterward, Lai constructed a counterexample to this…

An edge colored graph $G$ is rainbow edge connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph $G$, denoted by $rc(G)$, is the smallest number of colors that are…

A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one another edge. In this work we prove that each 1-planar graph of minimum degree at least $3$ contains an edge with degrees of its endvertices of…

A drawing of a graph is said to be a {\em straight-line drawing} if the vertices of $G$ are represented by distinct points in the plane and every edge is represented by a straight-line segment connecting the corresponding pair of vertices…

Given a finite set T of maps on a finite ring R, we look at the finite simple graph G=(V,E) with vertex set V=R and edge set E={(a,b) | exists t in T, b=t(a), b not equal to a}. An example is when R=Z_n and T consists of a finite set of…

In the classical knot theory there is a well-known notion of descending diagram. From an arbitrary diagram one can easily obtain, by some crossing changes, a descending diagram which is a diagram of the unknot or unlink. In this paper the…

A 1-planar graph is a graph which has a drawing on the plane such that each edge is crossed at most once. If a 1-planar graph is drawn in that way, the drawing is called a {\it 1-plane graph}. A graph is maximal 1-plane (or 1-planar) if no…