The following pages link to Donglei Yang (Q1732772):
Displaying 33 items.
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 (Q1732773) (← links)
- Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10 (Q1740118) (← links)
- On splitting digraphs (Q1750217) (← links)
- Strong list-chromatic index of subcubic graphs (Q1800415) (← links)
- On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\) (Q1999744) (← links)
- Vertex-disjoint rainbow triangles in edge-colored graphs (Q2005705) (← links)
- Antimagic orientations of graphs with large maximum degree (Q2005714) (← 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)
- Clique immersion in graphs without a fixed bipartite graph (Q2171024) (← links)
- List strong edge-coloring of graphs with maximum degree 4 (Q2174601) (← links)
- A note on antimagic orientations of even regular graphs (Q2322893) (← links)
- On the equitable edge-coloring of 1-planar graphs and planar graphs (Q2409529) (← links)
- Local antimagic labeling of graphs (Q2423101) (← links)
- Antimagic orientations of graphs with given independence number (Q2659069) (← links)
- (Q5127648) (← links)
- Antimagic orientations of even regular graphs (Q5379814) (← links)
- Embedding clique-factors in graphs with low \(\ell\)-independence number (Q6038592) (← links)
- Graph Tilings in Incompatibility Systems (Q6046822) (← links)
- Clique-factors in graphs with sublinear -independence number (Q6064154) (← links)
- Balanced subdivisions of cliques in graphs (Q6081404) (← links)
- A Ramsey–Turán theory for tilings in graphs (Q6185051) (← links)
- Extremal density for subdivisions with length or sparsity constraints (Q6519170) (← links)
- \(H\)-factors in graphs with small independence number (Q6615761) (← links)
- On powers of Hamilton cycles in Ramsey-Turán theory (Q6622733) (← links)
- Spanning trees in graphs without large bipartite holes (Q6632805) (← links)
- Covering the edges of a graph with triangles (Q6635092) (← links)
- Compatible powers of Hamilton cycles in dense graphs (Q6657592) (← links)
- Transversal Hamilton cycle in hypergraph systems (Q6668348) (← links)
- Embedding clique subdivisions via crux (Q6729944) (← links)
- Balanced clique subdivisions and cycles lengths in $K_{s, t}$-free graphs (Q6734749) (← links)
- Topological cliques in sparse expanders (Q6754051) (← links)
- Ramsey--Dirac theory for bounded degree hypertrees (Q6755373) (← links)
