Xinmin Hou

According to our database, Xinmin Hou authored at least 45 papers between 2003 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

A Dirac-Type Theorem for Uniform Hypergraphs.

Yue Ma, Xinmin Hou, Jun Gao

Graphs Comb., August, 2024

2023

Maximal Fractional Cross-Intersecting Families.

Hongkui Wang, Xinmin Hou

Graphs Comb., August, 2023

Some exact results of the generalized Turán numbers for paths.

Doudou Hei, Xinmin Hou, Boyuan Liu

Eur. J. Comb., May, 2023

The Degree and Codegree Threshold for Linear Triangle Covering in 3-Graphs.

Yuxuan Tang, Yue Ma, Xinmin Hou

Electron. J. Comb., 2023

2022

Maximizing the number of independent sets of fixed size in K n -covered graphs.

Anyao Wang, Xinmin Hou, Boyuan Liu, Yue Ma

J. Graph Theory, 2022

Strongly Connected Orientation with Minimum Lexicographic Order of Indegrees.

Hongyu Zhou, Xinmin Hou

Int. J. Found. Comput. Sci., 2022

A Note on Shortest Sign-Circuit Cover of Signed 3-Edge-Colorable Cubic Graphs.

Ronggui Xu, Jiaao Li, Xinmin Hou

Graphs Comb., 2022

Rainbow independent sets in graphs with maximum degree two.

Yue Ma, Xinmin Hou, Jun Gao, Boyuan Liu, Zhi Yin

Discret. Appl. Math., 2022

An improved probability propagation algorithm for density peak clustering based on natural nearest neighborhood.

Wendi Zuo, Xinmin Hou

Array, 2022

2021

The Turán number for the edge blow-up of trees.

Anyao Wang, Xinmin Hou, Boyuan Liu, Yue Ma

Discret. Math., 2021

Minimizing the number of edges in C≥r-saturated graphs.

Yue Ma, Xinmin Hou, Doudou Hei, Jun Gao

Discret. Math., 2021

2020

Minimum degree of 3-graphs without long linear paths.

Yue Ma, Xinmin Hou, Jun Gao

Discret. Math., 2020

Exact Minimum Codegree Thresholds for $K_4^-$-Covering and $K_5^-$-Covering.

Lei Yu, Xinmin Hou, Yue Ma, Boyuan Liu

Electron. J. Comb., 2020

Codegree Threshold for Tiling Balanced Complete $3$-Partite $3$-Graphs and Generalized $4$-Cycles.

Xinmin Hou, Boyuan Liu, Yue Ma

Electron. J. Comb., 2020

2019

H-Decomposition of r-Graphs when H is an r-Graph with Exactly k Independent Edges.

Xinmin Hou, Boyuan Liu, Hongliang Lu

Graphs Comb., 2019

The size of 3-uniform hypergraphs with given matching number and codegree.

Xinmin Hou, Lei Yu, Jun Gao, Boyuan Liu

Discret. Math., 2019

2018

Mod (2p+1)-Orientation on Bipartite Graphs and Complementary Graphs.

Jiaao Li, Xinmin Hou, Miaomiao Han, Hong-Jian Lai

SIAM J. Discret. Math., 2018

Decomposition of Graphs into (k, r)-Fans and Single Edges.

Xinmin Hou, Yu Qiu, Boyuan Liu

J. Graph Theory, 2018

Odd Induced Subgraphs in Graphs with Treewidth at Most Two.

Xinmin Hou, Lei Yu, Jiaao Li, Boyuan Liu

Graphs Comb., 2018

The Edge Spectrum of K₄^--Saturated Graphs.

Jun Gao, Xinmin Hou, Yue Ma

Graphs Comb., 2018

Turán number and decomposition number of intersecting odd cycles.

Xinmin Hou, Yu Qiu, Boyuan Liu

Discret. Math., 2018

2017

A note on broom number and maximum edge-cut of graphs.

Zhen-Mu Hong, Xinmin Hou, Jiaao Li, Yang Yang

Ars Comb., 2017

2016

On Perfect Matching Coverings and Even Subgraph Coverings.

Xinmin Hou, Hong-Jian Lai, Cun-Quan Zhang

J. Graph Theory, 2016

Extremal Graph for Intersecting Odd Cycles.

Xinmin Hou, Yu Qiu, Boyuan Liu

Electron. J. Comb., 2016

2015

Parity Subgraphs with Few Common Edges and Nowhere-Zero 5-Flow.

Jiaao Li, Xinmin Hou, Zhen-Mu Hong, Xiaofeng Ding

Graphs Comb., 2015

2012

A note on shortest cycle covers of cubic graphs.

Xinmin Hou, Cun-Quan Zhang

J. Graph Theory, 2012

Group connectivity of complementary graphs.

Xinmin Hou, Hong-Jian Lai, Ping Li, Cun-Quan Zhang

J. Graph Theory, 2012

The total {k}-domatic number of wheels and complete graphs.

Jing Chen, Xinmin Hou, Ning Li

J. Comb. Optim., 2012

Z₃-connectivity of 4-edge-connected 2-triangular graphs.

Xinmin Hou, Hong-Jian Lai, Mingquan Zhan, Taoye Zhang, Ju Zhou

Eur. J. Comb., 2012

2011

On the Perfect Matchings of Near Regular Graphs.

Xinmin Hou

Graphs Comb., 2011

2010

On the (2, 2)-domination number of trees.

Xinmin Hou, You Lu, Jun-Ming Xu

Discuss. Math. Graph Theory, 2010

A characterization of <i>(γ_t, γ₂)</i>-trees.

Xinmin Hou, Ning Li, You Lu, Jun-Ming Xu

Discuss. Math. Graph Theory, 2010

2009

The forwarding indices of wrapped butterfly networks.

Xinmin Hou, Jun-Ming Xu, Min Xu

Networks, 2009

On the total {<i>k</i>}-domination number of Cartesian products of graphs.

Ning Li, Xinmin Hou

J. Comb. Optim., 2009

On the {k}-domination number of Cartesian products of graphs.

Xinmin Hou, You Lu

Discret. Math., 2009

Bounded edge-connectivity and edge-persistence of Cartesian product of graphs.

You Lu, Jun-Ming Xu, Xinmin Hou

Discret. Appl. Math., 2009

A Note on the Distance-Balanced Property of Generalized Petersen Graphs.

Rui Yang, Xinmin Hou, Ning Li, Wei Zhong

Electron. J. Comb., 2009

2008

Paired Domination Vertex Critical Graphs.

Xinmin Hou, Michelle Edwards

Graphs Comb., 2008

A characterization of (2gamma, gamma_p)-trees.

Xinmin Hou

Discret. Math., 2008

2007

On reliability of the folded hypercubes.

Qiang Zhu, Jun-Ming Xu, Xinmin Hou, Min Xu

Inf. Sci., 2007

Total domination of Cartesian products of graphs.

Xinmin Hou

Discuss. Math. Graph Theory, 2007

2005

Fault diameter of Cartesian product graphs.

Min Xu, Junming Xu, Xinmin Hou

Inf. Process. Lett., 2005

Forwarding indices of folded <i>n</i>-cubes.

Xinmin Hou, Min Xu, Jun-Ming Xu

Discret. Appl. Math., 2005

2004

The proof of a conjecture of Bouabdallah and Sotteau.

Min Xu, Xinmin Hou, Jun-Ming Xu

Networks, 2004

2003

An Algorithm to Construct k-Regular k-Connected Graphs with the Maximum k-Diameter.

Xinmin Hou, Bolian Liu, Tianming Wang

Graphs Comb., 2003