相关论文: Ordered graphs and large bi-cliques in intersectio…

The symmetric difference of two graphs $G_1,G_2$ on the same set of vertices $V$ is the graph on $V$ whose set of edges are all edges that belong to exactly one of the two graphs $G_1,G_2$. For a fixed graph $H$ call a collection ${\cal G}$…

A graph $G$ is equimatchable if any matching in $G$ is a subset of a maximum-size matching. It is known that any $2$-connected equimatchable graph is either bipartite or factor-critical. We prove that for any vertex $v$ of a $2$-connected…

An induced path factor of a graph $G$ is a set of induced paths in $G$ with the property that every vertex of $G$ is in exactly one of the paths. The induced path number $\rho(G)$ of $G$ is the minimum number of paths in an induced path…

A path $P$ in a graph $G$ is said to be a degree monotone path if the sequence of degrees of the vertices of $P$ in the order in which they appear on $P$ is monotonic. The length of the longest degree monotone path in $G$ is denoted by…

A graph $G$ is Hamiltonian-connected if there exists a Hamiltonian path between any two vertices of $G$. It is known that if $G$ is 2-connected then the graph $G^2$ is Hamiltonian-connected. In this paper we prove that the square of every…

Mixed graphs can be seen as digraphs with arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite and in which the undirected and directed degrees are one. The best graphs,…

A drawing of a graph in the plane is called 1-planar if each edge is crossed at most once. A graph together with a 1-planar drawing is a 1-plane graph. A 1-plane graph $G$ with exactly $4|V (G)|-8$ edges is called optimal. The crossing…

We prove that for every set $S$ of vertices of a directed graph $D$, the maximum number of vertices in $S$ contained in a collection of vertex-disjoint cycles in $D$ is at least the minimum size of a set of vertices that hits all cycles…

Reed and Wood and independently Norine, Seymour, Thomas, and Wollan proved that for each positive integer $t$ there is a constant $c(t)$ such that every graph on $n$ vertices with no $K_t$-minor has at most $c(t)n$ cliques. Wood asked in…

A chorded cycle in a graph $G$ is a cycle on which two nonadjacent vertices are adjacent in the graph $G$. In 2010, Gao and Qiao independently proved a graph of order at least $4s$, in which the neighborhood union of any two nonadjacent…

An $(m, n)$-colored mixed graph is a graph having arcs of $m$ different colors and edges of $n$ different colors. A graph homomorphism of an $(m, n$)-colored mixed graph $G$ to an $(m, n)$-colored mixed graph $H$ is a vertex mapping such…

Let $\mathcal{G}$ be a minor-closed graph class. We say that a graph $G$ is a $k$-apex of $\mathcal{G}$ if $G$ contains a set $S$ of at most $k$ vertices such that $G\setminus S$ belongs to $\mathcal{G}.$ We denote by $\mathcal{A}_k…

A simple undirected graph is said to be {\em semisymmetric} if it is regular and edge-transitive but not vertex-transitive. Every semisymmetric graph is a bipartite graph with two parts of equal size. It was proved in [{\em J. Combin.…

Testing if a given graph $G$ contains the $k$-vertex path $P_k$ as a minor or as an induced minor is trivial for every fixed integer $k\geq 1$. However, the situation changes for the problem of checking if a graph can be modified into $P_k$…

The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\ge 3$ there exists a unique graph $G$ satisfying the following conditions:…

In this paper, our goal is to characterize two graph classes based on the properties of minimal vertex (edge) separators. We first present a structural characterization of graphs in which every minimal vertex separator is a stable set. We…

A topological graph drawn on a cylinder whose base is horizontal is \emph{angularly monotone} if every vertical line intersects every edge at most once. Let $c(n)$ denote the maximum number $c$ such that every simple angularly monotone…

The connected coalition in a graph $G=(V,E)$ consists of two disjoint sets of vertices $V_{1}$ and $V_{2}$, neither of which is a connected dominating set but whose union $V_{1}\cup V_{2}$, is a connected dominating set. A connected…

A geometric intersection graph is constructed over a set of geometric objects, where each vertex represents a distinct object and an edge connects two vertices if and only if the corresponding objects intersect. We examine the problem of…

A bipartite graph is called bipancyclic if it contains cycles of every even length from four up to the number of vertices in the graph. A theorem of Schmeichel and Mitchem states that for $n \geq 4$, every balanced bipartite graph on $2n$…