侯新民
Click:
The Founding Time:..
The Last Update Time:..
· Scan attention
·Paper Publications
- [21] [1] Doudou Hei; Xinmin Hou; Boyuan Liu, Some exact results of the generalized Turán numbers for paths, European J. Combin., 110(2023): 103682..
- [22] [2] Wang, Anyao; Hou, Xinmin; Liu, Boyuan; Ma, Yue, Maximizing the number of independent sets of fixed size in Kn-covered graphs, J. Graph Theory, 99(2)(2022): 175-185. .
- [23] [1] Doudou Hei; Xinmin Hou; Boyuan Liu, Some exact results of the generalized Turán numbers for paths, European J. Combin., 110(2023): 103682..
- [24] 侯新民.Maximizing the number of independent sets of fixed size in Kn‐covered graphs.Journal of Graph Theory,2022,99175-185.
- [25] The spectral radius of graphs without trees of diameter at most four.LINEAR & MULTILINEAR ALGEBRA,2021,
- [26] Hou Xinmin,Hou Xinmin.Odd Induced Subgraphs in Graphs with Treewidth at Most Two.GRAPHS AND COMBINATORICS,2018,34(4):535-544.
- [27] Hou Xinmin,Hou Xinmin.Decomposition of Graphs into (k, r)-Fans and Single Edges.JOURNAL OF GRAPH THEORY,2017,87(1):46-60.
- [28] Hou Xinmin,Hou Xinmin.Turan number and decomposition number of intersecting odd cycles.DISCRETE MATHEMATICS,2017,341(1):126-137.
- [29] Hou Xinmin,Hou Xinmin.Extremal graph for intersecting odd cycles.ELECTRONIC JOURNAL OF COMBINATORICS,2016,23(2):
- [30] Hou Xinmin,Hou Xinmin.On Perfect Matching Coverings and Even Subgraph Coverings.JOURNAL OF GRAPH THEORY,2015,81(1):83-91.