The following pages link to Yuan Qiu Huang (Q1708382):
Displayed 50 items.
- (Q868397) (redirect page) (← links)
- A note on the computational complexity of graph vertex partition (Q868398) (← links)
- On the lower bounds for the maximum genus for simple graphs (Q976145) (← links)
- The crossing number of \(C(8,2)\square P_{n}\) (Q1015432) (← links)
- Upper embeddability, girth and the degree-sum of nonadjacent vertices (Q1043810) (← links)
- Upper embeddability, edge independence number and girth (Q1044280) (← links)
- The maximum genus of graphs with diameter three (Q1297478) (← links)
- Extensions on 2-edge connected 3-regular up-embeddable graphs (Q1299840) (← links)
- Maximum genus and chromatic number of graphs (Q1408870) (← links)
- A note on the maximum genus of 3-edge-connected nonsimple graphs (Q1589799) (← links)
- The crossing numbers of join of some graphs with \(n\) isolated vertices (Q1656906) (← links)
- The crossing number of join of the generalized Petersen graph \(P(3, 1)\) with path and cycle (Q1708383) (← links)
- The crossing number of the hexagonal graph \(H_{3,n}\) (Q1717209) (← links)
- Face size and the maximum genus of a graph. I: Simple graphs (Q1850506) (← links)
- Maximum genus of a graph in terms of its embedding properties. (Q1868846) (← links)
- Maximum genus, independence number and girth (Q1976598) (← links)
- On the sizes of bipartite 1-planar graphs (Q2030739) (← links)
- The maximal 1-planarity and crossing numbers of graphs (Q2042209) (← links)
- A note on the crossing number of the cone of a graph (Q2053697) (← links)
- The crossing number of hexagonal graph \(H_{3,n }\) in the projective plane (Q2062681) (← links)
- The crossing number of \(K_{5,n+1} \setminus e\) (Q2177670) (← links)
- The crossing number of Cartesian product of 5-wheel with any tree (Q2214315) (← links)
- Two recursive inequalities for crossing numbers of graphs (Q2358375) (← links)
- The crossing number of the Cartesian product of paths with complete graphs (Q2449179) (← links)
- The crossing number of \(K_{1,4,n}\) (Q2477388) (← links)
- Maximum genus, connectivity and minimal degree of graphs (Q2570108) (← links)
- New upper bounds for the crossing numbers of crossing-critical graphs (Q2675851) (← links)
- (Q2721751) (← links)
- (Q2725256) (← links)
- (Q2757130) (← links)
- (Q2823337) (← links)
- (Q2823364) (← links)
- (Q2823381) (← links)
- (Q2828989) (← links)
- (Q2858681) (← links)
- (Q2859813) (← links)
- (Q2859872) (← links)
- (Q2887154) (← links)
- (Q2916457) (← links)
- (Q2992097) (← links)
- (Q2992136) (← links)
- (Q3014503) (← links)
- (Q3023074) (← links)
- (Q3054095) (← links)
- (Q3054116) (← links)
- (Q3054358) (← links)
- (Q3066318) (← links)
- (Q3071273) (← links)
- (Q3071838) (← links)
- (Q3071839) (← links)