Dingjun Lou

most citedNotes on factor-criticality, extendibility and independence number

7 citations · 15 across the 5 of their papers we have counts for

collaborators

5 papers

math.CO2017

M-alternating Hamilton paths and M-alternating Hamilton cycles

Zan-Bo Zhang, Yueping Li, Dingjun Lou

We study $M$ -alternating Hamilton paths and $M$ -alternating Hamilton cycles in a simple connected graph $G$ on $ν$ vertices with a perfect matching $M$ . Let $G$ be a bipartite grap…

math.CO2017

Minimum size of n-factor-critical graphs and k-extendable graphs

Zanbo Zhang, Xiaoyan Zhang, Dingjun Lou +1

We determine the minimum size of $n$ -factor-critical graphs and that of $k$ -extendable bipartite graphs, by considering Harary graphs and related graphs. Moreover, we determine the…

math.CO2010★ 3 cited

Bipartite graphs with a perfect matching and digraphs

Zan-Bo Zhang, Dingjun Lou

In this paper, we introduce a corresponding between bipartite graphs with a perfect matching and digraphs, which implicates an equivalent relation between the extendibility of bipa…

math.CO2010★ 7 cited

Notes on factor-criticality, extendibility and independence number

Zan-Bo Zhang, Dingjun Lou, Xiaoyan Zhang

In this paper, we give a sufficient and necessary condition for a $k$ -extendable graph to be $2 k$ -factor-critical when $k = ν /4$ , and prove some results on independence numbers in $n…

math.CO2010★ 5 cited

Equivalence between Extendibility and Factor-Criticality

Zan-Bo Zhang, Tao Wang, Dingjun Lou

In this paper, we show that if $k \geq (ν + 2) /4$ , where $ν$ denotes the order of a graph, a non-bipartite graph $G$ is $k$ -extendable if and only if it is $2 k$ -factor-critical. If $k…