Jiangdong Ai

Orcid: 0000-0002-5691-3365

According to our database1, Jiangdong Ai authored at least 20 papers between 2019 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
On the degree power sum in P k -free graphs.
Discret. Appl. Math., 2026

2025
Generalizations of Ferber-Krivelevich and Gallai Theorems on parity of degrees in induced subgraphs.
CoRR, September, 2025

Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials.
J. Graph Theory, 2025

r-dynamic colorings and the spectral radius in graphs.
Discret. Appl. Math., 2025

Arc-disjoint in- and out-branchings in semicomplete split digraphs.
Discret. Appl. Math., 2025

A new perspective from hypertournaments to tournaments.
Discret. Appl. Math., 2025

Piercing Independent Sets in Graphs without Large Induced Matching.
Electron. J. Comb., 2025

A Variable Version of the Quasi-Kernel Conjecture.
Electron. J. Comb., 2025

The Minimum Spectral Radius of $tP_3$- or $K_5$-Saturated Graphs via the Number of $2$-Walks.
Electron. J. Comb., 2025

2024
On Seymour's and Sullivan's second neighbourhood conjectures.
J. Graph Theory, March, 2024

Bounds on Maximum Weight Directed Cut.
SIAM J. Discret. Math., 2024

2023
Results on the small quasi-kernel conjecture.
Discret. Math., July, 2023

Proper orientation, proper biorientation and semi-proper orientation numbers of graphs.
J. Comb. Optim., 2023

2022
Kings in multipartite hypertournaments.
J. Graph Theory, 2022

Extended path partition conjecture for semicomplete and acyclic compositions.
Discret. Math., 2022

2021
Proximity and remoteness in directed and undirected graphs.
Discret. Math., 2021

2020
Proper orientation number of triangle-free bridgeless outerplanar graphs.
J. Graph Theory, 2020

k-Ary spanning trees contained in tournaments.
Discret. Appl. Math., 2020

Note on 4-Kings in Bipartite Hypertournaments.
CoRR, 2020

2019
Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs.
Discret. Math., 2019


  Loading...