Xinmin Hou

643 total citations
59 papers, 390 citations indexed

About

Xinmin Hou is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Xinmin Hou has authored 59 papers receiving a total of 390 indexed citations (citations by other indexed papers that have themselves been cited), including 50 papers in Computational Theory and Mathematics, 29 papers in Discrete Mathematics and Combinatorics and 21 papers in Geometry and Topology. Recurrent topics in Xinmin Hou's work include Advanced Graph Theory Research (44 papers), Limits and Structures in Graph Theory (27 papers) and Graph theory and applications (19 papers). Xinmin Hou is often cited by papers focused on Advanced Graph Theory Research (44 papers), Limits and Structures in Graph Theory (27 papers) and Graph theory and applications (19 papers). Xinmin Hou collaborates with scholars based in China, United States and Canada. Xinmin Hou's co-authors include Jun‐Ming Xu, Min Xu, Qiang Zhu, Ning Li, Boyuan Liu, Yu Qiu, Benxue Ma, Qiang Zhang, Jing Zhao and Wei Zhong and has published in prestigious journals such as Information Sciences, Theoretical Computer Science and Linear Algebra and its Applications.

In The Last Decade

Xinmin Hou

42 papers receiving 357 citations

Peers

Xinmin Hou
Dan Pritikin United States
Xinmin Hou
Citations per year, relative to Xinmin Hou Xinmin Hou (= 1×) peers Dan Pritikin

Countries citing papers authored by Xinmin Hou

Since Specialization
Citations

This map shows the geographic impact of Xinmin Hou's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Xinmin Hou with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Xinmin Hou more than expected).

Fields of papers citing papers by Xinmin Hou

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Xinmin Hou. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Xinmin Hou. The network helps show where Xinmin Hou may publish in the future.

Co-authorship network of co-authors of Xinmin Hou

This figure shows the co-authorship network connecting the top 25 collaborators of Xinmin Hou. A scholar is included among the top collaborators of Xinmin Hou based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Xinmin Hou. Xinmin Hou is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Hou, Xinmin, et al.. (2025). Long antipaths and anticycles in oriented graphs. Discrete Mathematics. 348(5). 114412–114412.
2.
Hou, Xinmin, et al.. (2024). Research on a three-dimensional radiation field reconstruction algorithm based on an improved 3D CNN. Applied Radiation and Isotopes. 214. 111540–111540.
3.
Hou, Xinmin, et al.. (2024). A Dirac-Type Theorem for Uniform Hypergraphs. Graphs and Combinatorics. 40(4).
4.
Hou, Xinmin, et al.. (2024). Counting triangles in regular graphs. Journal of Graph Theory. 107(4). 759–777.
5.
Hou, Xinmin, et al.. (2023). Some exact results of the generalized Turán numbers for paths. European Journal of Combinatorics. 110. 103682–103682. 1 indexed citations
6.
Hou, Xinmin, et al.. (2023). The Cycle of Length Four is Strictly F-Turán-Good. Bulletin of the Malaysian Mathematical Sciences Society. 47(1).
7.
Hou, Xinmin, et al.. (2018). The spectral radius of graphs without long cycles. Linear Algebra and its Applications. 566. 17–33. 31 indexed citations
8.
Hou, Xinmin, et al.. (2018). The size of 3-uniform hypergraphs with given matching number and codegree. Discrete Mathematics. 342(3). 760–767. 2 indexed citations
9.
Hou, Xinmin, Yu Qiu, & Boyuan Liu. (2017). Turán number and decomposition number of intersecting odd cycles. Discrete Mathematics. 341(1). 126–137. 9 indexed citations
10.
Hou, Xinmin, Hong‐Jian Lai, & Cun‐Quan Zhang. (2015). On Perfect Matching Coverings and Even Subgraph Coverings. Journal of Graph Theory. 81(1). 83–91. 7 indexed citations
11.
Hou, Xinmin, et al.. (2011). Z3-connectivity of 4-edge-connected 2-triangular graphs. European Journal of Combinatorics. 33(2). 182–188. 1 indexed citations
12.
Hou, Xinmin & Cun‐Quan Zhang. (2011). A note on shortest cycle covers of cubic graphs. Journal of Graph Theory. 71(2). 123–127. 1 indexed citations
13.
Hou, Xinmin, et al.. (2010). A characterization of (γ t2 )-trees. Discussiones Mathematicae Graph Theory. 30(3). 425–425. 2 indexed citations
14.
Xu, Jun‐Ming, et al.. (2009). Bounded edge-connectivity and edge-persistence of Cartesian product of graphs. Discrete Applied Mathematics. 157(15). 3249–3257. 2 indexed citations
15.
Hou, Xinmin. (2007). A characterization of (2γ,γp)-trees. Discrete Mathematics. 308(15). 3420–3426. 3 indexed citations
16.
Hou, Xinmin. (2007). Total domination of Cartesian products of graphs. Discussiones Mathematicae Graph Theory. 27(1). 175–175. 2 indexed citations
17.
Xu, Jun‐Ming, Min Xu, & Xinmin Hou. (2006). FORWARDING INDICES OF CARTESIAN PRODUCT GRAPHS. Taiwanese Journal of Mathematics. 10(5). 1305–1315. 3 indexed citations
18.
Xu, Jun‐Ming, Min Xu, & Xinmin Hou. (2006). FORWARDING INDICES OF CARTESIAN PRODUCT GRAPHS. Taiwanese Journal of Mathematics. 10(5). 8 indexed citations
19.
Hou, Xinmin, Min Xu, & Jun‐Ming Xu. (2004). Forwarding indices of folded n-cubes. Discrete Applied Mathematics. 145(3). 490–492. 17 indexed citations
20.
Hou, Xinmin & Tianming Wang. (2003). ON GENERALIZED WIDE DIAMETER OF GRAPHS. Taiwanese Journal of Mathematics. 7(2). 339–345.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026