The following pages link to Guang-Hui Wang (Q249728):
Displayed 50 items.
- Decomposing edge-colored graphs under color degree constraints (Q1689962) (← links)
- Rainbow Hamiltonian cycles in strongly edge-colored graphs (Q1727799) (← links)
- Local antimagic orientations of \(d\)-degenerate graphs (Q1730236) (← links)
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 (Q1732773) (← links)
- Generalized acyclic edge colorings via entropy compression (Q1743494) (← links)
- On splitting digraphs (Q1750217) (← links)
- Existence of rainbow matchings in properly edge-colored graphs (Q1758120) (← links)
- Symmetric PH and EP distributions and their applications to the probability Hough transform (Q1767797) (← links)
- Ranking the spreading ability of nodes in complex networks based on local structure (Q1782730) (← links)
- Strong list-chromatic index of subcubic graphs (Q1800415) (← links)
- Change-point detection in multinomial data with a large number of categories (Q1800792) (← links)
- Uzawa-type algorithm based on dual mixed variational formulation. (Q1861036) (← links)
- Circular coloring of planar digraphs (Q1928289) (← links)
- A note on heterochromatic \(C_4\) in edge-colored triangle-free graphs (Q1928290) (← links)
- Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable (Q1934390) (← links)
- Fractional \(f\)-edge cover chromatic index of graphs (Q2014721) (← links)
- The linear \(t\)-colorings of Sierpiński-like graphs (Q2014728) (← links)
- Properly colored short cycles in edge-colored graphs (Q2065117) (← links)
- Shape of the asymptotic maximum sum-free sets in integer lattice grids (Q2080236) (← links)
- Information spreading with relative attributes on signed networks (Q2126223) (← links)
- Integer colorings with no rainbow \(k\)-term arithmetic progression (Q2143413) (← links)
- Clique immersion in graphs without a fixed bipartite graph (Q2171024) (← links)
- Local antimagic orientation of graphs (Q2175055) (← links)
- Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs (Q2182186) (← links)
- Visual tracking via subspace learning: a discriminative approach (Q2200001) (← links)
- Total-coloring of sparse graphs with maximum degree 6 (Q2240657) (← links)
- Circular vertex arboricity (Q2275930) (← links)
- Properly colored spanning trees in edge-colored graphs (Q2279275) (← links)
- Dynamic contest model with bounded rationality (Q2287619) (← links)
- The \(r\)-acyclic chromatic number of planar graphs (Q2343993) (← links)
- A necessary test for complete independence in high dimensions using rank-correlations (Q2350669) (← links)
- Orthogonal matchings revisited (Q2352074) (← links)
- Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\) (Q2352779) (← links)
- Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz (Q2409525) (← links)
- Neighbor sum distinguishing total coloring of 2-degenerate graphs (Q2410029) (← links)
- The adjacent vertex distinguishing total chromatic numbers of planar graphs with \(\Delta=10\) (Q2410091) (← links)
- Equitable vertex arboricity of 5-degenerate graphs (Q2410094) (← links)
- Local antimagic labeling of graphs (Q2423101) (← links)
- Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 (Q2424800) (← links)
- Long properly colored cycles in edge colored complete graphs (Q2440943) (← links)
- Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree (Q2452418) (← links)
- Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs (Q2514004) (← links)
- A relaxed case on 1-2-3 conjecture (Q2631083) (← links)
- Neighbor sum (set) distinguishing total choosability of \(d\)-degenerate graphs (Q2631097) (← links)
- Neighbor sum distinguishing index of \(K_4\)-minor free graphs (Q2631098) (← links)
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree (Q2636830) (← links)
- Tiling multipartite hypergraphs in quasi-random hypergraphs (Q2692780) (← links)
- (Q2720754) (← links)
- (Q2725148) (← links)
- (Q2859806) (← links)