相关论文: Critical Vertices and Edges in $H$-free Graphs

In this note, we consider the following problem: given a connected graph $G$, can we reduce the domination number of $G$ by using only one edge contraction? We show that the problem is polynomial-time solvable on $P_3+kP_2$-free graphs for…

We say a hypergraph $\mathcal{H}$ contains a graph $G$ as trace if there exists a vertex subset $S \subseteq V(\mathcal{H})$ such that $|S| = V(G)$ and $\{e \cap S \mid e \in E(\mathcal{H})\}$ contains $G$ as a subgraph. We use…

A coloring is distinguishing (or symmetry breaking) if no non-identity automorphism preserves it. The distinguishing threshold of a graph $G$, denoted by $\theta(G)$, is the minimum number of colors $k$ so that every $k$-coloring of $G$ is…

Vertex deletion and edge deletion problems play a central role in Parameterized Complexity. Examples include classical problems like Feedback Vertex Set, Odd Cycle Transversal, and Chordal Deletion. Interestingly, the study of edge…

A new algorithm to obtain the chromatic number of a finite, connected graph is proposed in this paper. The algorithm is based on contraction of non adjacent vertices.

The Colouring problem is that of deciding, given a graph $G$ and an integer $k$, whether $G$ admits a (proper) $k$-colouring. For all graphs $H$ up to five vertices, we classify the computational complexity of Colouring for…

We study homomorphism problems of signed graphs from a computational point of view. A signed graph $(G,\Sigma)$ is a graph $G$ where each edge is given a sign, positive or negative; $\Sigma\subseteq E(G)$ denotes the set of negative edges.…

A subset $D$ of $V$ is \emph{dominating} in $G$ if every vertex of $V-D$ has at least one neighbour in $D;$ let $\gamma(G)$ be the minimum cardinality among all dominating sets in $G.$ A graph $G$ is $\gamma$-$q$-{\it critical} if the…

A graph H is a vertex-minor of a graph G if it can be reached from G by the successive application of local complementations and vertex deletions. Vertex-minors have been the subject of intense study in graph theory over the last decades…

This paper introduces the notion of an $(\iota,q)$-critical graph. The isolation number of a graph $G$, denoted by $\iota(G)$ and also known as the vertex-edge domination number of $G$, is the size of a smallest subset $D$ of the vertex set…

We prove that a graph with a cut vertex whose deletion produces at least five connected components must be missing a connected partition of some type. We prove that this also holds if there are four connected components that each have at…

For an arbitrary invariant $\rho (G)$ of a graph $G$, the $\rho-$vertex stability number $vs_{\rho}(G)$ is the minimum number of vertices of $G$ whose removal results in a graph $H\subseteq G$ with $\rho (H)\neq \rho (G)$ or with…

Frei et al. [6] showed that the problem to decide whether a graph is stable with respect to some graph parameter under adding or removing either edges or vertices is $\Theta_2^{\text{P}}$-complete. They studied the common graph parameters…

A graph $G$ is said to be perfectly divisible if for every induced subgraph $H$ of $G$ with at least one edge, the vertex set $V(H)$ can be partitioned into two sets $A, B$ such that $H[A]$ is perfect and $\omega(B) < \omega(H)$. It is easy…

A 2-edge-colored graph or a signed graph is a simple graph with two types of edges. A homomorphism from a 2-edge-colored graph $G$ to a 2-edge-colored graph $H$ is a mapping $\varphi: V(G) \rightarrow V(H)$ that maps every edge in $G$ to an…

The clique chromatic number of a graph is the minimum number of colours needed to colour its vertices so that no inclusion-wise maximal clique which is not an isolated vertex is monochromatic. We show that every graph of maximum degree…

For an edge-colored graph $G$, the minimum color degree of $G$ means the minimum number of colors on edges which are adjacent to each vertex of $G$. We prove that if $G$ is an edge-colored graph with minimum color degree at least $5$ then…

We give a new, stronger proof that there are only finitely many $k$-vertex-critical ($P_5$,~gem)-free graphs for all $k$. Our proof further refines the structure of these graphs and allows for the implementation of a simple exhaustive…

For graphs $G, F_1$ and $F_2$, we say that $G$ is $(F_1,F_2)$-free if neither $F_1$ nor $F_2$ is an induced subgraph of $G$. We say that $G$ is $k$-vertex-critical if the chromatic number of $G$ is $k$, but every proper induced subgraph of…

We consider the problem of reducing the (semi)total domination number of graph by one by contracting edges. It is known that this can always be done with at most three edge contractions and that deciding whether one edge contraction…