The following pages link to Changqing Xu (Q234877):
Displaying 50 items.
- Symmetric stochastic inverse eigenvalue problem (Q264513) (← links)
- On extreme \(U_1\) matrices (Q389656) (← links)
- \(\{0,1\}\) completely positive tensors and multi-hypergraphs (Q501224) (← links)
- Generalized Vandermonde tensors (Q528214) (← links)
- Robust optimization for the correlated MIMO downlink with imperfect channel state information (Q615213) (← links)
- The number of isosceles right triangles determined by \(n\) points in convex position in the plane (Q701800) (← links)
- \(5 \times 5\) completely positive matrices (Q703621) (← links)
- Tensor convolutions and Hankel tensors (Q721460) (← links)
- Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers (Q862738) (← links)
- A new proof for \(DP_n=CP_n\) \((n\geq 4)\) (Q875670) (← links)
- A note on the \((g, f)\)-coloring (Q949352) (← links)
- A note on algorithms for determining the copositivity of a given symmetric matrix (Q962500) (← links)
- Edge covered critical multigraphs (Q998374) (← links)
- A note on the edge cover chromatic index of multigraphs (Q998396) (← links)
- Revisiting Hua-Marcus-Bellman-Ando inequalities on contractive matrices (Q1002251) (← links)
- Sharp bounds for the spectral radius of digraphs (Q1002262) (← links)
- \([r,s,t]\)-coloring of \(K_{n,n}\) (Q1034949) (← links)
- A note on city block distance (Q1272733) (← links)
- Completely positive matrices. (Q1426310) (← links)
- About 4-isosceles planar sets (Q1597673) (← links)
- Nearly completely positive graphs (Q1598119) (← links)
- Neighbor sum distinguishing total chromatic number of 2-degenerate graphs (Q1627882) (← links)
- Neighbor sum distinguishing total coloring of planar graphs without 4-cycles (Q1679510) (← links)
- On the inverse eigenvalue problem for irreducible doubly stochastic matrices of small orders (Q1725228) (← links)
- \(\{0,1\}\) completely positive matrices (Q1772719) (← links)
- On \(\{0,1\}\) CP tensors and CP pseudographs (Q1790471) (← links)
- On the empty convex partition of a finite set in the plane. (Q1861024) (← links)
- The lower bound of the number of non-overlapping triangles. (Q1871441) (← links)
- Packing rectangles into a rectangle (Q1887410) (← links)
- More about 4-isosceles planar sets (Q1889920) (← links)
- Adjacent vertex distinguishing edge coloring of IC-planar graphs (Q2136165) (← links)
- Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions (Q2181235) (← links)
- Fourier matrices and Fourier tensors (Q2239350) (← links)
- Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles (Q2282476) (← links)
- Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 (Q2292143) (← links)
- Neighbor sum distinguishing total chromatic number of planar graphs (Q2333237) (← links)
- Row stochastic inverse eigenvalue problem (Q2376386) (← links)
- Neighbor sum distinguishing total coloring of planar graphs without 5-cycles (Q2402272) (← links)
- Neighbor sum distinguishing total chromatic number of \(K_4\)-minor free graph (Q2405976) (← links)
- Neighbor sum distinguishing total coloring of 2-degenerate graphs (Q2410029) (← links)
- A note on the neighbor sum distinguishing total coloring of planar graphs (Q2629242) (← links)
- Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs (Q2631097) (← links)
- A note on completely positive graphs (Q2721915) (← links)
- A jigsaw puzzle for squares (Q2743096) (← links)
- Positivities of Vandermonde tensors (Q2805661) (← links)
- Neighbor sum distinguishing total coloring of the Halin graph (Q2824285) (← links)
- Neighbor sum distinguishing total coloring of a kind of sparse graph. (Q2829032) (← links)
- Vertex-coloring edge-weighting of complete \(r\)-partite graphs (Q2870955) (← links)
- The edge cover chromatic index of complete tripartite graphs (Q2895420) (← links)
- An upper bound on the linear 2-arboricity of a planar graph (Q2924784) (← links)
