In decomposition theory, extreme sets have been studied extensively due to its connection to perfect matchings in a graph. In this paper, we first define extreme sets with respect to degree-matchings and next investigate some of their properties. In particular, we prove the generalized Decomposition Theorem and give a characterization for the set of all extreme vertices in a graph
AbstractA general criterion is proved for a graph of any cardinality to possess a perfect matching. ...
AbstractWe examine classes of extremal graphs for the inequality γ(G)⩽|V|-max{d(v)+βv(G)}, where γ(G...
AbstractProposing them as a general framework, Liu and Yu (2001) [6] introduced (n,k,d)-graphs to un...
AbstractLet ω0(G) denote the number of odd components of a graph G. The deficiency of G is defined a...
This dissertation answers several questions in extremal graph theory, each concerning the maximum or...
AbstractForests on n vertices with maximum number of maximal matchings are called extremal forests. ...
This dissertation answers several questions in extremal graph theory, each concerning the maximum or...
Let $G$ be a simple graph with a perfect matching. Deng and Zhang showed thatthe maximum anti-forcin...
AbstractGallai and Edmonds independently obtained a canonical decomposition of graphs in terms of th...
AbstractIn matching theory, barrier sets (also known as Tutte sets) have been studied extensively du...
This thesis is concerned with extremal problems on graphs and similar structures. We first study de...
A matching of a graph is a subset of the edges of that graph, such that no two edges in the matching...
AbstractRecently, Bauer et al. [D. Bauer, H.J. Broersma, A. Morgana, E. Schmeichel, Tutte sets in gr...
AbstractFor a graph property P, we define a P-matching as a set M of disjoint edges such that the su...
AbstractProofs are given of theorems of Lovász and Brualdi on the existence in a finite simple graph...
AbstractA general criterion is proved for a graph of any cardinality to possess a perfect matching. ...
AbstractWe examine classes of extremal graphs for the inequality γ(G)⩽|V|-max{d(v)+βv(G)}, where γ(G...
AbstractProposing them as a general framework, Liu and Yu (2001) [6] introduced (n,k,d)-graphs to un...
AbstractLet ω0(G) denote the number of odd components of a graph G. The deficiency of G is defined a...
This dissertation answers several questions in extremal graph theory, each concerning the maximum or...
AbstractForests on n vertices with maximum number of maximal matchings are called extremal forests. ...
This dissertation answers several questions in extremal graph theory, each concerning the maximum or...
Let $G$ be a simple graph with a perfect matching. Deng and Zhang showed thatthe maximum anti-forcin...
AbstractGallai and Edmonds independently obtained a canonical decomposition of graphs in terms of th...
AbstractIn matching theory, barrier sets (also known as Tutte sets) have been studied extensively du...
This thesis is concerned with extremal problems on graphs and similar structures. We first study de...
A matching of a graph is a subset of the edges of that graph, such that no two edges in the matching...
AbstractRecently, Bauer et al. [D. Bauer, H.J. Broersma, A. Morgana, E. Schmeichel, Tutte sets in gr...
AbstractFor a graph property P, we define a P-matching as a set M of disjoint edges such that the su...
AbstractProofs are given of theorems of Lovász and Brualdi on the existence in a finite simple graph...
AbstractA general criterion is proved for a graph of any cardinality to possess a perfect matching. ...
AbstractWe examine classes of extremal graphs for the inequality γ(G)⩽|V|-max{d(v)+βv(G)}, where γ(G...
AbstractProposing them as a general framework, Liu and Yu (2001) [6] introduced (n,k,d)-graphs to un...