The following pages link to Cheng Zhao (Q221634):
Displaying 50 items.
- Connection between the clique number and the Lagrangian of 3-uniform hypergraphs (Q276313) (← links)
- On graph-Lagrangians of hypergraphs containing dense subgraphs (Q467466) (← links)
- On the largest graph-Lagrangian of 3-graphs with fixed number of edges (Q467468) (← links)
- On Lagrangians of \(r\)-uniform hypergraphs (Q498456) (← links)
- Characterization of \(P_{6}\)-free graphs (Q881583) (← links)
- An extension of the Motzkin-Straus theorem to non-uniform hypergraphs and its applications (Q906443) (← links)
- Generating non-jumping numbers recursively (Q944738) (← links)
- On non-strong jumping numbers and density structures of hypergraphs (Q1043558) (← links)
- (Q1363751) (redirect page) (← links)
- Vertex-splitting and chromatic index critical graphs (Q1363752) (← links)
- Uncoupled PID control of coupled multi-agent nonlinear uncertain systems (Q1746992) (← links)
- A continuous characterization of the maximum vertex-weighted clique in hypergraphs (Q1752628) (← links)
- A new bound on the feedback vertex sets in cubic graphs (Q1910543) (← links)
- Graphs that admit 3-to-1 or 2-to-1 maps onto the circle (Q1917280) (← links)
- Control of nonlinear uncertain systems by extended PID with differential trackers (Q2048483) (← links)
- On the maxima of Motzkin-Straus programs and cliques of graphs (Q2089888) (← links)
- Towards a theoretical foundation of PID control for uncertain nonlinear systems (Q2151873) (← links)
- A sharp interface immersed boundary method for flow-induced noise prediction using acoustic perturbation equations (Q2245442) (← links)
- An extremal problern for set families generated with the union and symmetric difference operations (Q2375852) (← links)
- A Motzkin-Straus type result for 3-uniform hypergraphs (Q2376079) (← links)
- On Motzkin-Straus type results for non-uniform hypergraphs (Q2410100) (← links)
- Generalized \(k\)-multiway cut problems (Q2504075) (← links)
- Some results on Lagrangians of hypergraphs (Q2636814) (← links)
- On PID control theory for nonaffine uncertain stochastic systems (Q2699258) (← links)
- (Q2716645) (← links)
- (Q2747198) (← links)
- (Q2760448) (← links)
- (Q2788226) (← links)
- (Q2823215) (← links)
- (Q3088450) (← links)
- (Q3356320) (← links)
- (Q3358751) (← links)
- (Q3816103) (← links)
- (Q4028538) (← links)
- (Q4206746) (← links)
- Smallest (1, 2)‐eulerian weight and shortest cycle covering (Q4284101) (← links)
- A sufficient condition for a regular graph to be class 1 (Q4285592) (← links)
- (Q4288085) (← links)
- (Q4288160) (← links)
- (Q4326210) (← links)
- Coloring graphs which have equibipartite complements (Q4376493) (← links)
- (Q4387734) (← links)
- (Q4432932) (← links)
- (Q4503110) (← links)
- Approximation Algorithms for Some Graph Partitioning Problems (Q4511245) (← links)
- (Q4636270) (← links)
- Remote sensing image fusion via RPCA and adaptive PCNN in NSST domain (Q4689128) (← links)
- (Q4874600) (← links)
- (Q4892326) (← links)
- Control of Nonlinear Uncertain Systems by Extended PID (Q4957635) (← links)
