The following pages link to Xin Min Hou (Q1928145):
Displaying 50 items.
- (Q286109) (redirect page) (← links)
- Extremal graph for intersecting odd cycles (Q286112) (← links)
- Parity subgraphs with few common edges and nowhere-zero 5-flow (Q497352) (← links)
- \(Z_3\)-connectivity of 4-edge-connected 2-triangular graphs (Q658001) (← links)
- On the perfect matchings of near regular graphs (Q659743) (← links)
- Minimum degree of 3-graphs without long linear paths (Q776262) (← links)
- Exact minimum codegree thresholds for \(K_4^-\)-covering and \(K_5^-\)-covering (Q785570) (← links)
- (Q835041) (redirect page) (← links)
- Fault diameter of Cartesian product graphs (Q835042) (← links)
- Forwarding indices of Cartesian product graphs (Q861440) (← links)
- On reliability of the folded hypercubes (Q881847) (← links)
- A characterization of \((2\gamma ,\gamma _{\text p})\)-trees (Q932620) (← links)
- Bounded edge-connectivity and edge-persistence of Cartesian product of graphs (Q967381) (← links)
- Paired domination vertex critical graphs (Q1014834) (← links)
- On the \(\{k\}\)-domination number of Cartesian products of graphs (Q1025971) (← links)
- On the total \(\{k\}\)-domination number of Cartesian products of graphs (Q1037451) (← links)
- An algorithm to construct \(k\)-regular \(k\)-connected graphs with the maximum \(k\)-diameter (Q1396656) (← links)
- On generalized wide diameter of graphs. (Q1432846) (← links)
- Weak internal partition of regular graphs (Q1690616) (← links)
- The size of 3-uniform hypergraphs with given matching number and codegree (Q1712519) (← links)
- \(H\)-decomposition of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly \(k\) independent edges (Q1733864) (← links)
- The spectral radius of graphs without long cycles (Q1736228) (← links)
- The edge spectrum of \(K_4^-\)-saturated graphs (Q1756131) (← links)
- Forwarding indices of folded \(n\)-cubes (Q1765529) (← links)
- On generalized \(k\)-diameter of \(k\)-regular \(k\)-connected graphs (Q1771535) (← links)
- A note on \(Z_3\)-connected graphs with degree sum condition (Q1928146) (← links)
- The total \(\{k\}\)-domatic number of wheels and complete graphs (Q1928533) (← links)
- Signed reinforcement numbers of certain graphs (Q1928634) (← links)
- Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs (Q1981694) (← links)
- Rainbow independent sets in graphs with maximum degree two (Q2142692) (← links)
- A note on shortest sign-circuit cover of signed 3-edge-colorable cubic graphs (Q2168862) (← links)
- Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles (Q2195224) (← links)
- The Turán number for the edge blow-up of trees (Q2231738) (← links)
- Codegree threshold for tiling \(k\)-graphs with two edges sharing exactly \(\ell\) vertices (Q2287773) (← links)
- Turán number and decomposition number of intersecting odd cycles (Q2411603) (← links)
- Odd induced subgraphs in graphs with treewidth at most two (Q2413620) (← links)
- On restricted connectivity and extra connectivity of hypercubes and folded hypercubes (Q2574474) (← links)
- Some exact results of the generalized Turán numbers for paths (Q2700989) (← links)
- Group connectivity of complementary graphs (Q2891054) (← links)
- (Q2895378) (← links)
- A note on shortest cycle covers of cubic graphs (Q2911057) (← links)
- A characterization of (γ<sub>t</sub>,γ<sub>2</sub>)-trees (Q2997602) (← links)
- (Q3004147) (← links)
- (Q3014362) (← links)
- (Q3054357) (← links)
- The forwarding indices of wrapped butterfly networks (Q3057090) (← links)
- On the (2,2)-domination number of trees (Q3059088) (← links)
- (Q3105555) (← links)
- (Q3115084) (← links)
- (Q3134394) (← links)