The following pages link to Xiangqian Zhou (Q251556):
Displayed 44 items.
- A maximum resonant set of polyomino graphs (Q274682) (← links)
- A minimax result for perfect matchings of a polyomino graph (Q277641) (← links)
- Bicircular matroids representable over \(\mathrm{GF}(4)\) or \(\mathrm{GF}(5)\) (Q297920) (← links)
- Generating an internally 4-connected binary matroid from another (Q442330) (← links)
- The strong chromatic index of \((3,\Delta)\)-bipartite graphs (Q512620) (← links)
- On internally 4-connected non-regular binary matroids (Q598474) (← links)
- Clonal sets in \(GF(q)\)-representable matroids (Q708392) (← links)
- Distinguishability of locally finite trees (Q874003) (← links)
- Clones in 3-connected frame matroids (Q906478) (← links)
- On minimally \(k\)-connected matroids (Q958691) (← links)
- On clone sets of \(GF(q)\)-representable matroids (Q1024496) (← links)
- On minor-minimally 3-connected binary matroids (Q1025948) (← links)
- The class of binary matroids with no \(M\)(\(K_{3,3}\))-, \(M^{*}\)(\(K_{3,3}\))-, \(M\)(\(K_{5}\))- or \(M^{*}\)(\(K_{5}\))-minor. (Q1425117) (← links)
- Strong edge-coloring for planar graphs with large girth (Q1625788) (← links)
- On binary matroids without a \(P_{10}\)-minor (Q1637097) (← links)
- On critical circuits in \(k\)-connected matroids (Q1756122) (← links)
- Some minor-closed classes of signed graphs (Q1937540) (← links)
- Every lobster is odd-elegant (Q1941690) (← links)
- Some novel minimax results for perfect matchings of hexagonal systems (Q2166259) (← links)
- Gallai-Ramsey numbers for rainbow \(P_5\) and monochromatic fans or wheels (Q2166308) (← links)
- The inclusion-free edge-colorings of \((3, \varDelta)\)-bipartite graphs (Q2172399) (← links)
- The strong chromatic index of graphs with edge weight eight (Q2185830) (← links)
- Triangle-roundedness in matroids (Q2280003) (← links)
- The strong edge-coloring for graphs with small edge weight (Q2297732) (← links)
- DP-4-colorability of two classes of planar graphs (Q2324485) (← links)
- Unavoidable minors of large 4-connected bicircular matroids (Q2343466) (← links)
- Clones in matroids representable over a prime field (Q2411620) (← links)
- A note on binary matroid with no \(M(K_{3,3})\)-minor (Q2464163) (← links)
- Generating weakly 4-connected matroids (Q2483478) (← links)
- (Q2858196) (← links)
- (Q2858761) (← links)
- (Q2918235) (← links)
- (Q4897463) (← links)
- (Q4901059) (← links)
- Forcing and anti-forcing polynomials of perfect matchings of a pyrene system (Q5165192) (← links)
- Recent progress on strong edge-coloring of graphs (Q5242836) (← links)
- (Q5279137) (← links)
- (Q5401074) (← links)
- A Splitter Theorem for Internally 4‐Connected Binary Matroids (Q5757374) (← links)
- A new proof for a result of Kingan and Lemos' (Q5964999) (← links)
- Strong list-chromatic index of planar graphs with Ore-degree at most seven (Q6083189) (← links)
- List strong edge-colorings of sparse graphs (Q6090823) (← links)
- Representations of signed graphs (Q6185336) (← links)
- Ramsey Achievement Games on Graphs : Algorithms and Bounds (Q6428733) (← links)