相关论文: Uniquely cycle-saturated graphs

A signed bipartite (simple) graph $(G, \sigma)$ is said to be $C_{-4}$-critical if it admits no homomorphism to $C_{-4}$ (a negative 4-cycle) but every proper subgraph of it does. In this work, first of all we show that the notion of…

A hole is a chordless cycle with at least four vertices. A hole is odd if it has an odd number of vertices. A dart is a graph which vertices $a, b, c, d, e$ and edges $ab, bc, bd, be, cd, de$. Dart-free graphs have been actively studied in…

A pure pair in a graph $G$ is a pair $(Z_1,Z_2)$ of disjoint sets of vertices such that either every vertex in $Z_1$ is adjacent to every vertex in $Z_2$, or there are no edges between $Z_1$ and $Z_2$. With Maria Chudnovsky, we recently…

For $n \geq 15$, we prove that the minimum number of triangles in an $n$-vertex $K_4$-saturated graph with minimum degree 4 is exactly $2n-4$, and that there is a unique extremal graph. This is a triangle version of a result of Alon,…

In this paper we describe all edge-colored graphs that are fully symmetric with respect to colors and transitive on every set of edges of the same color. They correspond to fully symmetric homogeneous factorizations of complete graphs. Our…

We study how many copies of a graph $F$ that another graph $G$ with a given number of cliques is guaranteed to have. For example, one of our main results states that for all $t\ge 2$, if $G$ is an $n$ vertex graph with $kn^{3/2}$ triangles…

A graph is circle if its vertices are in correspondence with a family of chords in a circle in such a way that every two distinct vertices are adjacent if and only if the corresponding chords have nonempty intersection. Even though there…

Let $\gamma'_s(G)$ be the signed edge domination number of G. In 2006, Xu conjectured that: for any $2$-connected graph G of order $ n (n \geq 2),$ $\gamma'_s(G)\geq 1$. In this article we show that this conjecture is not true. More…

Given a graph $G$, we say a $k$-uniform hypergraph $H$ on the same vertex set contains a Berge-$G$ if there exists an injection $\phi:E(G)\to E(H)$ such that $e\subseteq\phi(e)$ for each edge $e\in E(G)$. A hypergraph $H$ is…

Strictly Chordality-k graphs (SC_k graphs) are graphs which are either cycle free or every induced cycle is exactly k, for some fixed k, k \geq 3. Note that k = 3 and k = 4 are precisely the Chordal graphs and Chordal Bipartite graphs,…

The triangle graph of a graph $G$, denoted by ${\cal T}(G)$, is the graph whose vertices represent the triangles ($K_3$ subgraphs) of $G$, and two vertices of ${\cal T}(G)$ are adjacent if and only if the corresponding triangles share an…

The topological containment problem is known to be polynomial-time solvable for any fixed pattern graph $H$, but good characterisations have been found for only a handful of non-trivial pattern graphs. The complete graph on five vertices,…

A graph $G=(V,E)$ is a pairwise compatibility graph (PCG) if there exists an edge-weighted tree $T$ and two non-negative real numbers $d_{min}$ and $d_{max}$, $d_{min} \leq d_{max}$, such that each node $u \in V$ is uniquely associated to a…

A connected $k$-chromatic graph $G$ is double-critical if for all edges $uv$ of $G$ the graph $G - u - v$ is $(k-2)$-colourable. The only known double-critical $k$-chromatic graph is the complete $k$-graph $K_k$. The conjecture that there…

We give a uniform and self-contained proof that if $G$ is a connected graph with $\chi(G) = \Delta(G)$ and $G\neq \overline{C_7}$, then $G$ contains either $K_{\Delta(G)}$ or an odd hole where every vertex has degree at least $\Delta(G)-1$…

For any pair of edges $e,f$ of a graph $G$, we say that {\em $e,f$ are $P_3$-connected in $G$} if there exists a sequence of edges $e=e_0,e_1,\ldots, e_k=f$ such that $e_i$ and $e_{i+1}$ are two edges of an induced $3$-vertex path in $G$…

A graph $G$ is perfectly divisible if every induced subgraph $H$ of $G$ contains a set $X$ of vertices such that $X$ meets all largest cliques of $H$, and $X$ induces a perfect graph. The chromatic number of a perfectly divisible graph $G$…

We prove that a graph $G$ contains no induced $5$-vertex path and no induced complement of a $5$-vertex path if and only if $G$ is obtained from $5$-cycles and split graphs by repeatedly applying the following operations: substitution,…

Lov\'asz has completely characterised the structure of graphs with no two vertex-disjoint cycles, while Slilaty has given a structural characterisation of graphs with no two vertex-disjoint odd cycles; his result is in fact more general,…

A copy of a graph $F$ is called an $F$-copy. For any graph $G$, the $F$-isolation number of $G$, denoted by $\iota(G,F)$, is the size of a smallest subset $D$ of the vertex set of $G$ such that the closed neighbourhood $N[D]$ of $D$ in $G$…