567 citations
- Harbin Institute of TechnologyCN54 papers
- University of Science and Technology of ChinaCN44 papers
- Chinese Academy of SciencesCN26 papers
- Zhejiang UniversityCN24 papers
- RIKENJP20 papers
- University of Chinese Academy of SciencesCN19 papers
- Institute of PhysicsPL18 papers
- Tsinghua UniversityCN18 papers
- University of MichiganUS18 papers
- Peking UniversityCN17 papers
- Northeast Normal UniversityCN16 papers
- Hangzhou Normal UniversityCN15 papers
26 papers · 1 filter
Paths with two blocks in oriented graphs of large minimum semi-degree
Bin Chen, Xinmin Hou, Xinyu Zhou
Stein (2020) conjectured that for any positive integer , every oriented graph of minimum semi-degree greater than contains every oriented path of length . This conjectu…
A generalization of Stiebitz-type results on graph decomposition
Qinghou Zeng, Chunlei Zu
In this paper, we consider the decomposition of multigraphs under minimum degree constraints and give a unified generalization of several results by various researchers. Let be…
Packing of spanning mixed arborescences
Hui Gao, Daqing Yang
In this paper, we characterize a mixed graph which contains edge and arc disjoint spanning mixed arborescences , such that for each , the…
Packing of maximal independent mixed arborescences
Hui Gao, Daqing Yang
Király in [On maximal independent arborescence packing, SIAM J. Discrete. Math. 30 (4) (2016), 2107-2114] solved the following packing problem: Given a digraph , a matr…
A curvature notion for planar graphs stable under planar duality
Yohji Akama, Bobo Hua, Yanhui Su +1
Woess \cite{Woess98} introduced a curvature notion on the set of edges of a planar graph, called -curvature in our paper, which is stable under the planar duality. We study geom…
Large book--cycle Ramsey numbers
Qizhong Lin, Xing Peng
Let be the book graph which consists of copies of all sharing a common , and let be a cycle of length . In this paper, we first determine th…