相关论文: Even cycles and perfect matchings in claw-free pla…

Given a family of graphs $\mathcal{H}$, a graph $G$ is $\mathcal{H}$-free if any subset of $V(G)$ does not induce a subgraph of $G$ that is isomorphic to any graph in $\mathcal{H}$. We present sufficient and necessary conditions for a graph…

A graph is called claw-free if it contains no induced subgraph isomorphic to the complete bipartite graph $K_{1, 3}$. The undirected power graph of a group $G$ has vertices the elements of $G$, with an edge between $g_1$ and $g_2$ if one of…

We call a (simple) graph G codismantlable if either it has no edges or else it has a codominated vertex x, meaning that the closed neighborhood of x contains that of one of its neighbor, such that G-x codismantlable. We prove that if G is…

Let $G_S$ be a self-loop graph as the graph obtained by attaching a self-loop at every vertex in $S \subseteq V(G)$ of a simple graph $G.$ If $G=C_n$ is the cycle graphs of order $n$ and $S \neq \emptyset,$ we show that there are no rank 3…

A graph $G$ has a $C_k$-decomposition if its edge set can be partitioned into cycles of length $k$. We show that if $\delta(G)\geq 2|G|/3-1$, then $G$ has a $C_4$-decomposition, and if $\delta(G)\geq |G|/2$, then $G$ has a…

Considering connected $K_{1,3}$-free graphs with independence number at least $3$, Chudnovsky and Seymour (2010) showed that every such graph, say $G$, is $2\omega$-colourable where $\omega$ denotes the clique number of $G$. We study…

Given two graphs $H_1$ and $H_2$, a graph $G$ is $(H_1,H_2)$-free if it contains no induced subgraph isomorphic to $H_1$ or $H_2$. Let $P_t$ be the path on $t$ vertices and $K_t$ be the complete graph on $t$ vertices. The diamond is the…

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…

We define a perfect coloring of a graph $G$ as a proper coloring of $G$ such that every connected induced subgraph $H$ of $G$ uses exactly $\omega(H)$ many colors where $\omega(H)$ is the clique number of $H$. A graph is perfectly colorable…

A graph is strongly perfect if every induced subgraph H has a stable set that meets every maximal clique of H. A graph is claw-free if no vertex has three pairwise non-adjacent neighbors. The characterization of claw-free graphs that are…

A graph is Berge if it has no induced odd cycle on at least 5 vertices and no complement of induced odd cycle on at least 5 vertices. A graph is perfect if the chromatic number equals the maximum clique number for every induced subgraph.…

We consider the class ${\cal A}$ of graphs that contain no odd hole, no antihole, and no "prism" (a graph consisting of two disjoint triangles with three disjoint paths between them). We prove that every graph $G\in{\cal A}$ different from…

Lovasz and Plummer conjectured that there exists a fixed positive constant c such that every cubic n-vertex graph with no cutedge has at least 2^(cn) perfect matchings. Their conjecture has been verified for bipartite graphs by Voorhoeve…

The perfect matching index of a cubic graph $G$, denoted by $\pi(G)$, is the smallest number of perfect matchings that cover all the edges of $G$. According to the Berge-Fulkerson conjecture, $\pi(G)\le5$ for every bridgeless cubic…

A {\em fork} is a graph obtained from $K_{1,3}$ (usually called {\em claw}) by subdividing an edge once, an {\em antifork} is the complement graph of a fork, and a {\em co-cricket} is a union of $K_1$ and $K_4-e$. A graph is perfectly…

Let $G$ be an edge-colored graph, a walk in $G$ is said to be a properly colored walk iff each pair of consecutive edges have different colors, including the first and the last edges in case that the walk be closed. Let $H$ be a graph…

A graph is well-covered if every maximal independent set has the same cardinality. The recognition problem of well-covered graphs is known to be co-NP-complete. Let w be a weight function defined on the vertices of G. Then G is…

We study two measures of uncolourability of cubic graphs, their colouring defect and perfect matching index. The colouring defect of a cubic graph $G$ is the smallest number of edges left uncovered by three perfect matchings; the perfect…

A clique-coloring of a graph $G$ is a coloring of the vertices of $G$ so that no maximal clique of size at least two is monochromatic. The clique-hypergraph, $\mathcal{H}(G)$, of a graph $G$ has $V(G)$ as its set of vertices and the maximal…

Let $G$ be a graph. We use $P_t$ and $C_t$ to denote a path and a cycle on $t$ vertices, respectively. A {\em diamond} is a graph obtained from two triangles that share exactly one edge. A {\em kite} is a graph consists of a diamond and…