Xin Min Hou

From MaRDI portal
Revision as of 13:09, 10 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Xin Min Hou to Xin Min Hou: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:1928145

Available identifiers

zbMath Open hou.xinminMaRDI QIDQ1928145

List of research outcomes

PublicationDate of PublicationType
The degree and codegree threshold for linear triangle covering in 3-graphs2024-02-16Paper
The cycle of length four is strictly \(F\)-Turán-good2023-11-20Paper
A new connectivity bound for a tournament to be highly linked2023-11-07Paper
Maximizing the number of independent sets of fixed size in Kn‐covered graphs2023-10-04Paper
Ramsey numbers of color critical graphs versus large generalized fans2023-08-21Paper
Multicolor Ramsey numbers on stars versus pat2023-08-19Paper
The degree threshold for covering with all the connected $3$-graphs with $3$ edges2023-08-19Paper
Strongly Connected Orientation with Minimum Lexicographic Order of Indegrees2023-08-15Paper
Ramsey-type results on parameters related to domination2023-08-15Paper
Maximal fractional cross-intersecting families2023-08-03Paper
Graphs without rainbow cliques of orders four and five2023-06-21Paper
On Induced Subgraph of Cartesian Product of Paths2023-06-06Paper
Spectral extrema of graphs with bounded clique number and matching number2023-05-15Paper
Some exact results of the generalized Turán numbers for paths2023-04-27Paper
Generalized Tur\'an problem with bounded matching number2023-01-13Paper
Maximum size of $C_{\leq k}$-free strong digraphs with out-degree at least two2022-11-06Paper
Minimizing the number of matchings of fixed size in a $K_s$-saturated graph2022-11-06Paper
A note on shortest sign-circuit cover of signed 3-edge-colorable cubic graphs2022-08-26Paper
Rainbow independent sets in graphs with maximum degree two2022-05-27Paper
A note on shortest circuit cover of 3-edge colorable cubic signed graphs2022-04-12Paper
https://portal.mardi4nfdi.de/entity/Q50331462022-02-22Paper
Some exact results of the generalized Tur\'an numbers for paths2021-12-29Paper
The Turán number for the edge blow-up of trees2021-09-30Paper
Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs2021-09-06Paper
The spectral radius of graphs without trees of diameter at most four2021-06-09Paper
https://portal.mardi4nfdi.de/entity/Q49847692021-04-26Paper
https://portal.mardi4nfdi.de/entity/Q51436702021-01-14Paper
Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles2020-09-08Paper
Exact minimum codegree thresholds for \(K_4^-\)-covering and \(K_5^-\)-covering2020-08-07Paper
Minimum degree of 3-graphs without long linear paths2020-07-08Paper
A Dirac-type theorem for uniform hypergraphs2020-04-10Paper
Codegree threshold for tiling \(k\)-graphs with two edges sharing exactly \(\ell\) vertices2020-01-21Paper
The score sequences with unique tournament that has minimum number of upsets2019-11-19Paper
An Erd\H{o}s-Gallai-type theorem for keyrings with larger number of leaves2019-10-05Paper
https://portal.mardi4nfdi.de/entity/Q51958772019-10-02Paper
https://portal.mardi4nfdi.de/entity/Q53821332019-06-21Paper
The spectral radius of graphs without long cycles2019-03-26Paper
\(H\)-decomposition of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly \(k\) independent edges2019-03-21Paper
The size of 3-uniform hypergraphs with given matching number and codegree2019-01-22Paper
The edge spectrum of \(K_4^-\)-saturated graphs2019-01-11Paper
Odd induced subgraphs in graphs with treewidth at most two2018-09-14Paper
Codegree conditions for tilling balanced complete $3$-partite $3$-graphs and generalized 4-cycles2018-05-15Paper
Decomposition of Graphs into (k,r)‐Fans and Single Edges2018-02-23Paper
https://portal.mardi4nfdi.de/entity/Q31343942018-02-09Paper
Weak internal partition of regular graphs2018-01-19Paper
Mod $(2p+1)$-Orientation on Bipartite Graphs and Complementary Graphs2018-01-12Paper
Turán number and decomposition number of intersecting odd cycles2017-10-24Paper
Extremal graph for intersecting odd cycles2016-05-20Paper
On Perfect Matching Coverings and Even Subgraph Coverings2016-02-01Paper
Parity subgraphs with few common edges and nowhere-zero 5-flow2015-09-24Paper
https://portal.mardi4nfdi.de/entity/Q49262912013-06-20Paper
The total \(\{k\}\)-domatic number of wheels and complete graphs2013-01-03Paper
Signed reinforcement numbers of certain graphs2013-01-03Paper
A note on \(Z_3\)-connected graphs with degree sum condition2013-01-02Paper
A note on shortest cycle covers of cubic graphs2012-09-12Paper
https://portal.mardi4nfdi.de/entity/Q28953782012-07-02Paper
Group connectivity of complementary graphs2012-06-13Paper
https://portal.mardi4nfdi.de/entity/Q31150842012-02-20Paper
On the perfect matchings of near regular graphs2012-01-24Paper
\(Z_3\)-connectivity of 4-edge-connected 2-triangular graphs2012-01-11Paper
https://portal.mardi4nfdi.de/entity/Q31055552012-01-05Paper
https://portal.mardi4nfdi.de/entity/Q30143622011-07-19Paper
https://portal.mardi4nfdi.de/entity/Q30041472011-05-31Paper
A characterization of (γt2)-trees2011-05-09Paper
On the (2,2)-domination number of trees2010-12-08Paper
The forwarding indices of wrapped butterfly networks2010-11-24Paper
https://portal.mardi4nfdi.de/entity/Q30543572010-11-05Paper
https://portal.mardi4nfdi.de/entity/Q35726042010-07-08Paper
Bounded edge-connectivity and edge-persistence of Cartesian product of graphs2010-04-28Paper
https://portal.mardi4nfdi.de/entity/Q34030112010-02-12Paper
On the total \(\{k\}\)-domination number of Cartesian products of graphs2009-11-16Paper
A note on the p-domination number of trees2009-10-26Paper
Fault diameter of Cartesian product graphs2009-08-27Paper
On the \(\{k\}\)-domination number of Cartesian products of graphs2009-06-23Paper
Paired domination vertex critical graphs2009-04-29Paper
A characterization of \((2\gamma ,\gamma _{\text p})\)-trees2008-07-11Paper
Total domination of Cartesian products of graphs2008-02-22Paper
On reliability of the folded hypercubes2007-05-18Paper
Forwarding indices of Cartesian product graphs2007-01-29Paper
https://portal.mardi4nfdi.de/entity/Q54789892006-07-14Paper
On restricted connectivity and extra connectivity of hypercubes and folded hypercubes2005-11-21Paper
On generalized \(k\)-diameter of \(k\)-regular \(k\)-connected graphs2005-04-18Paper
Forwarding indices of folded \(n\)-cubes2005-02-23Paper
The proof of a conjecture of Bouabdallah and Sotteau2005-01-12Paper
https://portal.mardi4nfdi.de/entity/Q48257932004-11-05Paper
On generalized wide diameter of graphs.2004-06-22Paper
An algorithm to construct \(k\)-regular \(k\)-connected graphs with the maximum \(k\)-diameter2003-07-08Paper
https://portal.mardi4nfdi.de/entity/Q45471272003-03-31Paper
Counting triangles in regular graphs0001-01-03Paper
Long antipaths and anticycles in oriented graphs0001-01-03Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Xin Min Hou