The following pages link to Hong Wang (Q185081):
Displayed 50 items.
- Item:Q185081 (redirect page) (← links)
- Proof of the Erdős-Faudree conjecture on quadrilaterals (Q607681) (← links)
- Packing three copies of a tree into a complete bipartite graph (Q659792) (← links)
- Partition of a bipartite graph into cycles (Q686183) (← links)
- \(P_{2p}\)-factorization of a complete bipartite graph (Q687148) (← links)
- Vertex-disjoint quadrilaterals in graphs (Q704291) (← links)
- Partition of a directed bipartite graph into two directed cycles (Q1126308) (← links)
- Packing three copies of a tree into a complete graph (Q1209730) (← links)
- Vertex-disjoint triangles in claw-free graphs with minimum degree at least three (Q1297765) (← links)
- On quadrilaterals in a graph (Q1301667) (← links)
- On the maximum number of independent cycles in a graph (Q1301840) (← links)
- On \(K_{1,k}\)-factorizations of a complete bipartite graph (Q1318824) (← links)
- Independent cycles with limited size in a graph (Q1340129) (← links)
- An extension of a theorem on cycles containing specified independent edges (Q1348118) (← links)
- On a conjecture on directed cycles in a directed bipartite graph (Q1376065) (← links)
- All trees contain a large induced subgraph having all degrees 1 (mod \(k\)) (Q1377743) (← links)
- Covering vertices of a graph by \(k\) disjoint cycles (Q1406550) (← links)
- Vertex-disjoint hexagons with chords in a bipartite graph (Q1584300) (← links)
- Triangles in claw-free graphs (Q1584304) (← links)
- Large vertex-disjoint cycles in a bipartite graph (Q1586586) (← links)
- Covering a graph with cycles of length at least 4 (Q1753038) (← links)
- On vertex-disjoint complete bipartite subgraphs in a bipartite graph (Q1808722) (← links)
- Bipartite graphs containing every possible pair of cycles (Q1817575) (← links)
- Two vertex-disjoint cycles in a graph (Q1906862) (← links)
- On the maximum number of independent cycles in a bipartite graph (Q1924141) (← links)
- Vertex-disjoint cycles containing specified edges (Q1972323) (← links)
- Disjoint directed cycles in directed graphs (Q2185930) (← links)
- Vertex-disjoint double chorded cycles in bipartite graphs (Q2312791) (← links)
- Maximal total length of \(k\) disjoint cycles in bitpartite graphs (Q2387188) (← links)
- Disjoint cycles in graphs with distance degree sum conditions (Q2400552) (← links)
- Disjoint long cycles in a graph (Q2441136) (← links)
- On long cycles in a 2-connected bipartite graph (Q2563427) (← links)
- Existence of two disjoint long cycles in graphs (Q2581410) (← links)
- Disjoint directed cycles with specified lengths in directed bipartite graphs (Q2659188) (← links)
- (Q2716025) (← links)
- On Covering a Bipartite Graph with Cycles (Q2784504) (← links)
- (Q2820191) (← links)
- (Q2869459) (← links)
- (Q2876050) (← links)
- DISJOINT CYCLES WITH PRESCRIBED LENGTHS AND INDEPENDENT EDGES IN GRAPHS (Q3191130) (← links)
- Pentagons and cycle coverings (Q3427372) (← links)
- (Q3565858) (← links)
- Packing two copies of a sparse graph into a graph with restrained maximum degree (Q3652549) (← links)
- (Q3751601) (← links)
- (Q4222092) (← links)
- (Q4248534) (← links)
- (Q4261189) (← links)
- (Q4262234) (← links)
- Path factors of bipartite graphs (Q4284102) (← links)
- (Q4325294) (← links)