Jiangdong Ai

Orcid: 0000-0002-5691-3365

According to our database¹, Jiangdong Ai authored at least 13 papers between 2019 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

On Seymour's and Sullivan's second neighbourhood conjectures.

[BibT_eX]

[DOI]

J. Graph Theory, March, 2024

Bounds on Maximum Weight Directed Cut.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2024

Number of Subgraphs and Their Converses in Tournaments and New Digraph Polynomials.

[BibT_eX]

[DOI]

CoRR, 2024

Piercing independent sets in graphs without large induced matching.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Results on the small quasi-kernel conjecture.

[BibT_eX]

[DOI]

Discret. Math., July, 2023

Proper orientation, proper biorientation and semi-proper orientation numbers of graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2023

2022

Kings in multipartite hypertournaments.

[BibT_eX]

[DOI]

Jiangdong Ai

Stefanie Gerke

Gregory Z. Gutin

J. Graph Theory, 2022

Extended path partition conjecture for semicomplete and acyclic compositions.

[BibT_eX]

[DOI]

Discret. Math., 2022

2021

Proximity and remoteness in directed and undirected graphs.

[BibT_eX]

[DOI]

Discret. Math., 2021

2020

Proper orientation number of triangle-free bridgeless outerplanar graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

k-Ary spanning trees contained in tournaments.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Note on 4-Kings in Bipartite Hypertournaments.

[BibT_eX]

[DOI]

Jiangdong Ai

Stefanie Gerke

Gregory Z. Gutin

CoRR, 2020

2019

Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs.

[BibT_eX]

[DOI]

Yuefang Sun

Gregory Z. Gutin

Jiangdong Ai

Discret. Math., 2019

Jiangdong Ai

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...