The following pages link to Yaping Mao (Q274704):
Displayed 30 items.
- Lower bounds for the spanning tree numbers of two graph products (Q6243227) (← links)
- Formally self-dual linear binary codes from circulant graphs (Q6249333) (← links)
- Additive codes over $GF(4)$ from circulant graphs (Q6250300) (← links)
- On the regular k-independence number of graphs (Q6261906) (← links)
- On the Equitable Vertex Arboricity of Graphs (Q6262247) (← links)
- Interval minors of complete multipartite graphs (Q6264261) (← links)
- On the pedant tree-connectivity of graphs (Q6264919) (← links)
- Path connectivity of line graphs (Q6271411) (← links)
- Line k-Arboricity in Product Networks (Q6271429) (← links)
- Pendant-tree connectivity of line graphs (Q6272280) (← links)
- The minimal size of graphs with given pendant-tree connectivity (Q6272827) (← links)
- The Steiner 4-diameter of a graph (Q6283343) (← links)
- The Steiner (n-3)-diameter of a graph (Q6284211) (← links)
- Steiner diameter, maximum degree and size of a graph (Q6285566) (← links)
- Nordhaus-Gaddum-type theorem for conflict-free connection number of graphs (Q6287029) (← links)
- Steiner Distance in Graphs--A Survey (Q6290263) (← links)
- Gallai-Ramsey numbers of odd cycles (Q6305898) (← links)
- Gallai-Ramsey numbers for fans (Q6314747) (← links)
- On the $g$-extra connectivity of graphs (Q6317131) (← links)
- Gallai Ramsey number for double stars (Q6332549) (← links)
- Bounds for Gallai-Ramsey functions and numbers (Q6344774) (← links)
- Note on the connectivity keeping spiders in $k$-connected graphs (Q6355626) (← links)
- Nordhaus-Guddum type results for the Steiner Gutman index of graphs (Q6372619) (← links)
- Some multivariable Rado numbers (Q6393128) (← links)
- A general approach to deriving diagnosability results of interconnection networks (Q6398169) (← links)
- Euclidean Gallai-Ramsey Theory (Q6412078) (← links)
- Constructing edge-disjoint Steiner trees in Cartesian product networks (Q6424820) (← links)
- Gallai-Ramsey Multiplicity (Q6427179) (← links)
- Ramsey Achievement Games on Graphs : Algorithms and Bounds (Q6428733) (← links)
- Constructing disjoint Steiner trees in Sierpi\'{n}ski graphs (Q6456637) (← links)