The following pages link to Jian-Feng Hou (Q995577):
Displaying 25 items.
- On \(( 2 , r )\)-choosability of planar graphs without short cycles (Q2698091) (← links)
- On \(L (p, q)\)-labelling of planar graphs without cycles of length four (Q2698183) (← links)
- A Planar linear arboricity conjecture (Q2891050) (← links)
- (Q2924785) (← links)
- Bounds for pairs in judicious partitioning of graphs (Q2951883) (← links)
- (Q3011725) (← links)
- Acyclic edge chromatic number of outerplanar graphs (Q3055902) (← links)
- Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles (Q3066941) (← links)
- (Q3115075) (← links)
- A BOUND ON THE BONDAGE NUMBER OF TOROIDAL GRAPHS (Q3166755) (← links)
- Binding number and Hamiltonian (<i>g, f</i>)-factors in graphs II (Q3526044) (← links)
- Bisections of Graphs Without Short Cycles (Q4601051) (← links)
- The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs (Q4605442) (← links)
- Maximum cuts of graphs with forbidden cycles (Q4615059) (← links)
- Erratum to “Acyclic Edge Chromatic Number of Outerplanar Graphs” (Q4916096) (← links)
- BIPARTITE SUBGRAPHS OF -FREE GRAPHS (Q4975587) (← links)
- On a Problem of Judicious<i>k</i>-Partitions of Graphs (Q4978292) (← links)
- (Q5199842) (← links)
- Bounds for the number of meeting edges in graph partitioning (Q5355069) (← links)
- Judicious Partitioning of Hypergraphs with Edges of Size at Most 2 (Q5366944) (← links)
- Some results about <i>f</i>‐critical graphs (Q5434587) (← links)
- Erratum: The Bollobás--Scott Conjecture for 4-Uniform Hypergraphs (Q5855530) (← links)
- Gallai's conjecture on path decompositions (Q6047576) (← links)
- On bisections of graphs without complete bipartite graphs (Q6056762) (← links)
- Counting triangles in graphs without vertex disjoint odd cycles (Q6457125) (← links)
