Hehui Wu

From MaRDI portal
Person:322347

Available identifiers

zbMath Open wu.hehuiMaRDI QIDQ322347

List of research outcomes





PublicationDate of PublicationType
List-avoiding orientations2025-01-14Paper
Partitioning graphs with linear minimum degree2024-10-24Paper
The inducibility of oriented stars2024-07-01Paper
Graph partitions under average degree constraint2024-01-15Paper
Partitioning graphs with linear minimum degree2023-06-13Paper
Proper orientations and proper chromatic number2023-05-02Paper
Triangle-free subgraphs with large fractional chromatic number2023-03-31Paper
Subgraphs of Kneser graphs with large girth and large chromatic number2022-12-19Paper
List-avoiding orientations2022-09-19Paper
On the Turán number of the linear \(3\)-graph \(C_{13}\)2022-09-06Paper
Fractional chromatic number of a random subgraph2022-03-31Paper
1-subdivisions, the fractional chromatic number and the Hall ratio2021-04-16Paper
The Betti Number of the Independence Complex of Ternary Graphs2020-11-22Paper
A Ramsey Type problem for highly connected subgraphs2020-08-20Paper
The inducibility of oriented stars2020-08-12Paper
Coloring tournaments: from local to global2019-07-17Paper
Weak duality for packing edge-disjoint odd (u, v)-trails2018-07-16Paper
Word-representability of split graphs2017-09-27Paper
Large Supports are required for Well-Supported Nash Equilibria2017-08-31Paper
The extremal function for disconnected minors2017-08-22Paper
DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER2017-04-04Paper
Triangle-free subgraphs with large fractional chromatic number2016-10-14Paper
Interval Minors of Complete Bipartite Graphs2016-08-12Paper
A Proof of a Conjecture of Ohba2015-05-22Paper
Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices2014-10-08Paper
Decomposition of sparse graphs into forests and a graph with bounded degree2013-11-15Paper
Complete minors, independent sets, and chordal graphs2012-09-05Paper
Packing of Steiner trees and \(S\)-connectors in graphs2012-03-19Paper
https://portal.mardi4nfdi.de/entity/Q31150522012-02-20Paper
Longest cycles in \(k\)-connected graphs with given independence number2011-12-08Paper
https://portal.mardi4nfdi.de/entity/Q35767222010-07-30Paper
The hub number of a graph2010-06-09Paper
Optimal strong parity edge-coloring of complete graphs2009-12-28Paper
On mod \((2p+1)\)-orientations of graphs2009-03-04Paper
https://portal.mardi4nfdi.de/entity/Q54432012008-02-20Paper
Every 3-connected, essentially 11-connected line graph is Hamiltonian2006-07-12Paper

Research outcomes over time

This page was built for person: Hehui Wu