default search action
Xinmin Hou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j45]Yue Ma, Xinmin Hou
, Jun Gao:
A Dirac-Type Theorem for Uniform Hypergraphs. Graphs Comb. 40(4): 76 (2024) - 2023
- [j44]Yuxuan Tang, Yue Ma, Xinmin Hou
The Degree and Codegree Threshold for Linear Triangle Covering in 3-Graphs. Electron. J. Comb. 30(4) (2023) - [j43]Doudou Hei, Xinmin Hou
Some exact results of the generalized Turán numbers for paths. Eur. J. Comb. 110: 103682 (2023) - [j42]Hongkui Wang, Xinmin Hou
Maximal Fractional Cross-Intersecting Families. Graphs Comb. 39(4): 81 (2023) - 2022
- [j41]Wendi Zuo
An improved probability propagation algorithm for density peak clustering based on natural nearest neighborhood. Array 15: 100232 (2022) - [j40]Yue Ma
Rainbow independent sets in graphs with maximum degree two. Discret. Appl. Math. 317: 101-108 (2022) - [j39]Ronggui Xu, Jiaao Li, Xinmin Hou
A Note on Shortest Sign-Circuit Cover of Signed 3-Edge-Colorable Cubic Graphs. Graphs Comb. 38(5): 144 (2022) - [j38]Hongyu Zhou, Xinmin Hou
Strongly Connected Orientation with Minimum Lexicographic Order of Indegrees. Int. J. Found. Comput. Sci. 33(2): 149-153 (2022) - [j37]Anyao Wang, Xinmin Hou
Maximizing the number of independent sets of fixed size in K n -covered graphs. J. Graph Theory 99(2): 175-185 (2022) - [i1]Wendi Zuo, Xinmin Hou:
An Improved Probability Propagation Algorithm for Density Peak Clustering Based on Natural Nearest Neighborhood. CoRR abs/2207.01178 (2022) - 2021
- [j36]Yue Ma
Minimizing the number of edges in C≥r-saturated graphs. Discret. Math. 344(11): 112565 (2021) - [j35]Anyao Wang, Xinmin Hou
The Turán number for the edge blow-up of trees. Discret. Math. 344(12): 112627 (2021) - 2020
- [j34]Xinmin Hou
Codegree Threshold for Tiling Balanced Complete $3$-Partite $3$-Graphs and Generalized $4$-Cycles. Electron. J. Comb. 27(3): 3 (2020) - [j33]Lei Yu, Xinmin Hou
Exact Minimum Codegree Thresholds for $K_4^-$-Covering and $K_5^-$-Covering. Electron. J. Comb. 27(3): 3 (2020) - [j32]Yue Ma
Minimum degree of 3-graphs without long linear paths. Discret. Math. 343(9): 111949 (2020)
2010 – 2019
- 2019
- [j31]Xinmin Hou
The size of 3-uniform hypergraphs with given matching number and codegree. Discret. Math. 342(3): 760-767 (2019) - [j30]Xinmin Hou
H-Decomposition of r-Graphs when H is an r-Graph with Exactly k Independent Edges. Graphs Comb. 35(1): 195-200 (2019) - 2018
- [j29]Xinmin Hou
Turán number and decomposition number of intersecting odd cycles. Discret. Math. 341(1): 126-137 (2018) - [j28]Xinmin Hou
Odd Induced Subgraphs in Graphs with Treewidth at Most Two. Graphs Comb. 34(4): 535-544 (2018) - [j27]Jun Gao, Xinmin Hou
The Edge Spectrum of K4--Saturated Graphs. Graphs Comb. 34(6): 1723-1727 (2018) - [j26]Xinmin Hou
Decomposition of Graphs into (k, r)-Fans and Single Edges. J. Graph Theory 87(1): 46-60 (2018) - [j25]Jiaao Li
Mod (2p+1)-Orientation on Bipartite Graphs and Complementary Graphs. SIAM J. Discret. Math. 32(1): 29-43 (2018) - 2017
- [j24]Zhen-Mu Hong, Xinmin Hou, Jiaao Li, Yang Yang:
A note on broom number and maximum edge-cut of graphs. Ars Comb. 133: 341-347 (2017) - 2016
- [j23]Xinmin Hou
Extremal Graph for Intersecting Odd Cycles. Electron. J. Comb. 23(2): 2 (2016) - [j22]Xinmin Hou
On Perfect Matching Coverings and Even Subgraph Coverings. J. Graph Theory 81(1): 83-91 (2016) - 2015
- [j21]Jiaao Li
Parity Subgraphs with Few Common Edges and Nowhere-Zero 5-Flow. Graphs Comb. 31(5): 1555-1566 (2015) - 2012
- [j20]Xinmin Hou
Z3-connectivity of 4-edge-connected 2-triangular graphs. Eur. J. Comb. 33(2): 182-188 (2012) - [j19]Jing Chen, Xinmin Hou
The total {k}-domatic number of wheels and complete graphs. J. Comb. Optim. 24(3): 162-175 (2012) - [j18]Xinmin Hou
Group connectivity of complementary graphs. J. Graph Theory 69(4): 464-470 (2012) - [j17]Xinmin Hou
A note on shortest cycle covers of cubic graphs. J. Graph Theory 71(2): 123-127 (2012) - 2011
- [j16]Xinmin Hou
On the Perfect Matchings of Near Regular Graphs. Graphs Comb. 27(6): 865-869 (2011) - 2010
- [j15]Xinmin Hou
On the (2, 2)-domination number of trees. Discuss. Math. Graph Theory 30(2): 185-199 (2010) - [j14]Xinmin Hou
A characterization of (γt, γ2)-trees. Discuss. Math. Graph Theory 30(3): 425-435 (2010)
2000 – 2009
- 2009
- [j13]Rui Yang, Xinmin Hou
A Note on the Distance-Balanced Property of Generalized Petersen Graphs. Electron. J. Comb. 16(1) (2009) - [j12]You Lu, Jun-Ming Xu, Xinmin Hou
Bounded edge-connectivity and edge-persistence of Cartesian product of graphs. Discret. Appl. Math. 157(15): 3249-3257 (2009) - [j11]Xinmin Hou
On the {k}-domination number of Cartesian products of graphs. Discret. Math. 309(10): 3413-3419 (2009) - [j10]Ning Li, Xinmin Hou
On the total {k}-domination number of Cartesian products of graphs. J. Comb. Optim. 18(2): 173-178 (2009) - [j9]Xinmin Hou
The forwarding indices of wrapped butterfly networks. Networks 53(4): 329-333 (2009) - 2008
- [j8]Xinmin Hou
A characterization of (2gamma, gammap)-trees. Discret. Math. 308(15): 3420-3426 (2008) - [j7]Xinmin Hou
Paired Domination Vertex Critical Graphs. Graphs Comb. 24(5): 453-459 (2008) - 2007
- [j6]Xinmin Hou:
Total domination of Cartesian products of graphs. Discuss. Math. Graph Theory 27(1): 175-178 (2007) - [j5]Qiang Zhu
On reliability of the folded hypercubes. Inf. Sci. 177(8): 1782-1788 (2007) - 2005
- [j4]Xinmin Hou
Forwarding indices of folded n-cubes. Discret. Appl. Math. 145(3): 490-492 (2005) - [j3]Min Xu, Junming Xu, Xinmin Hou
Fault diameter of Cartesian product graphs. Inf. Process. Lett. 93(5): 245-248 (2005) - 2004
- [j2]Min Xu, Xinmin Hou
The proof of a conjecture of Bouabdallah and Sotteau. Networks 44(4): 292-296 (2004) - 2003
- [j1]Xinmin Hou
An Algorithm to Construct k-Regular k-Connected Graphs with the Maximum k-Diameter. Graphs Comb. 19(1): 111-119 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-14 23:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: