summary:For given a graph $H$, a graphic sequence $\pi =(d_1,d_2,\ldots ,d_n)$ is said to be potentially $H$-graphic if there is a realization of $\pi $ containing $H$ as a subgraph. In this paper, we characterize the potentially $(K_5-e)$-positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence $\pi $ to be potentially $K_5$-graphic, where $K_r$ is a complete graph on $r$ vertices and $K_r-e$ is a graph obtained from $K_r$ by deleting one edge. Moreover, we also give a simple necessary and sufficient condition for a positive graphic sequence $\pi $ to be potentially $K_6$-graphic
AbstractA nonincreasing sequence of nonnegative integers π=(d1,d2,…,dn) is graphic if there is a (si...
We extend the notion of a potentially H-graphic sequence as follows. Let A and B be nonnegative inte...
AbstractFor a given graph H, a non-increasing sequence π=(d1,d2,…,dn) of nonnegative integers is sai...
summary:For given a graph $H$, a graphic sequence $\pi =(d_1,d_2,\ldots ,d_n)$ is said to be potenti...
summary:Let $K_m-H$ be the graph obtained from $K_m$ by removing the edges set $E(H)$ of $H$ whe...
summary:The set of all non-increasing nonnegative integer sequences $\pi =$ ($d(v_1 ),d(v_2 ), \dots...
Abstract. An integer sequence pi is said to be graphic if it is the degree sequence of some simple g...
Abstract. A nonincreasing sequence of nonnegative integers pi = (d1, d2,..., dn) is graphic if there...
Abstract. This paper is essentially a discussion of results found in the paper “Two sufficient condi...
Abstract. We consider a variation of the classical Turán-type extremal prob-lem as introduced by Er...
summary:The split graph $K_r+\overline {K_s}$ on $r+s$ vertices is denoted by $S_{r,s}$. A non-incre...
summary:Let $r\ge 3$, $n\ge r$ and $\pi =(d_1,d_2,\ldots ,d_n)$ be a non-increasing sequence of nonn...
A nonincreasing sequence pi = (d1, d2,···,dn) of nonnegative integers is said to be graphic if it i...
AbstractAn r-graph is a loopless undirected graph in which no two vertices are joined by more than r...
We extend the notion of a potentially H-graphic sequence as fol-lows. Let A and B be nonnegative int...
AbstractA nonincreasing sequence of nonnegative integers π=(d1,d2,…,dn) is graphic if there is a (si...
We extend the notion of a potentially H-graphic sequence as follows. Let A and B be nonnegative inte...
AbstractFor a given graph H, a non-increasing sequence π=(d1,d2,…,dn) of nonnegative integers is sai...
summary:For given a graph $H$, a graphic sequence $\pi =(d_1,d_2,\ldots ,d_n)$ is said to be potenti...
summary:Let $K_m-H$ be the graph obtained from $K_m$ by removing the edges set $E(H)$ of $H$ whe...
summary:The set of all non-increasing nonnegative integer sequences $\pi =$ ($d(v_1 ),d(v_2 ), \dots...
Abstract. An integer sequence pi is said to be graphic if it is the degree sequence of some simple g...
Abstract. A nonincreasing sequence of nonnegative integers pi = (d1, d2,..., dn) is graphic if there...
Abstract. This paper is essentially a discussion of results found in the paper “Two sufficient condi...
Abstract. We consider a variation of the classical Turán-type extremal prob-lem as introduced by Er...
summary:The split graph $K_r+\overline {K_s}$ on $r+s$ vertices is denoted by $S_{r,s}$. A non-incre...
summary:Let $r\ge 3$, $n\ge r$ and $\pi =(d_1,d_2,\ldots ,d_n)$ be a non-increasing sequence of nonn...
A nonincreasing sequence pi = (d1, d2,···,dn) of nonnegative integers is said to be graphic if it i...
AbstractAn r-graph is a loopless undirected graph in which no two vertices are joined by more than r...
We extend the notion of a potentially H-graphic sequence as fol-lows. Let A and B be nonnegative int...
AbstractA nonincreasing sequence of nonnegative integers π=(d1,d2,…,dn) is graphic if there is a (si...
We extend the notion of a potentially H-graphic sequence as follows. Let A and B be nonnegative inte...
AbstractFor a given graph H, a non-increasing sequence π=(d1,d2,…,dn) of nonnegative integers is sai...