The following pages link to Jian-Feng Hou (Q995577):
Displaying 50 items.
- (Q272314) (redirect page) (← links)
- On judicious partitions of uniform hypergraphs (Q272317) (← links)
- On the total choosability of planar graphs and of sparse graphs (Q407575) (← links)
- A bound for judicious \(k\)-partitions of graphs (Q477337) (← links)
- Monochromatic solutions for multi-term unknowns (Q503618) (← links)
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable (Q534337) (← links)
- Improved bounds for acyclic chromatic index of planar graphs (Q534360) (← links)
- Total coloring of planar graphs without 6-cycles (Q617651) (← links)
- Total coloring of embedded graphs of maximum degree at least ten (Q625795) (← links)
- Bipartitions of oriented graphs (Q723882) (← links)
- List edge and list total colorings of planar graphs without 4-cycles (Q861265) (← links)
- Acyclic coloring of graphs without bichromatic long path (Q889416) (← links)
- Total colorings of planar graphs without small cycles (Q937252) (← links)
- List edge and list total colorings of planar graphs without short cycles (Q975488) (← links)
- Edge-choosability of planar graphs without non-induced 5-cycles (Q976112) (← links)
- The linear arboricity of planar graphs with no short cycles (Q995578) (← links)
- Edge-choosability of planar graphs without adjacent triangles or without 7-cycles (Q998494) (← links)
- Total colorings of planar graphs without adjacent triangles (Q998509) (← links)
- The stability number and connected \([k,k+1]\)-factor in graphs (Q1023082) (← links)
- Acyclic edge coloring of planar graphs with large girth (Q1034642) (← links)
- Acyclic edge colorings of planar graphs and series parallel graphs (Q1042911) (← links)
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles (Q1045095) (← links)
- Partitioning dense uniform hypergraphs (Q1698057) (← links)
- Graphs of \(f\)-class 1 (Q1786886) (← links)
- On partitions of \(K_{2, 3}\)-free graphs under degree constraints (Q1800399) (← links)
- Acyclic edge coloring of planar graphs without small cycles (Q1926054) (← links)
- List total colorings of planar graphs without triangles at small distance (Q1942193) (← links)
- Acyclic chromatic index of planar graphs with triangles (Q1944145) (← links)
- An improved bound on acyclic chromatic index of planar graphs (Q1945955) (← links)
- Choosability with union separation of triangle-free planar graphs (Q2005734) (← links)
- On bipartitions of directed graphs with small semidegree (Q2011152) (← links)
- Uniform tight frames as optimal signals (Q2040994) (← links)
- Coloring graphs without bichromatic cycles or paths (Q2045232) (← links)
- On \((3, r)\)-choosability of some planar graphs (Q2117577) (← links)
- Maximum bisections of graphs without cycles of length 4 (Q2142653) (← links)
- On judicious bipartitions of directed graphs (Q2144584) (← links)
- Max-bisections of \(H\)-free graphs (Q2279266) (← links)
- A bound on judicious bipartitions of directed graphs (Q2303909) (← links)
- On total colorings of 1-planar graphs (Q2352360) (← links)
- On bisections of directed graphs (Q2357220) (← links)
- The method of coloring in graphs and its application (Q2429917) (← links)
- Every toroidal graph is acyclically 8-choosable (Q2440482) (← links)
- Acyclic edge coloring of planar graphs with girth at least 5 (Q2446889) (← links)
- Some properties on \(f\)-edge covered critical graphs (Q2454989) (← links)
- Biased partitions and judicious \(k\)-partitions of graphs (Q2627880) (← links)
- Choosability with union separation of planar graphs without cycles of length 4 (Q2656689) (← links)
- Odd induced subgraphs in planar graphs with large girth (Q2672043) (← links)
- Coloring squares of planar graphs with maximum degree at most five (Q2689129) (← links)
- Large induced subgraphs with three repeated degrees (Q2689512) (← links)
- Singular Turán numbers of stars (Q2694960) (← links)
