Yandong Bai

According to our database1, Yandong Bai authored at least 20 papers between 2012 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Properly colored cycles of different lengths in edge-colored complete graphs.
Discret. Math., December, 2023

Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs.
J. Comb. Optim., March, 2023

Connected <i>k</i>-factors in bipartite graphs.
Discret. Math., 2023

Sufficient conditions for properly colored C3's and C4's in edge-colored complete graphs.
Discret. Appl. Math., 2023

2021
Rainbow Triangles in Arc-Colored Tournaments.
Graphs Comb., 2021

Edge-Colored Complete Graphs Containing No Properly Colored Odd Cycles.
Graphs Comb., 2021

2020
Kernels by rainbow paths in arc-colored tournaments.
Discret. Appl. Math., 2020

2019
On the Number of Vertex-Disjoint Cycles in Digraphs.
SIAM J. Discret. Math., 2019

Safe sets in digraphs.
CoRR, 2019

2018
On splitting digraphs.
Eur. J. Comb., 2018

Kernels by properly colored paths in arc-colored digraphs.
Discret. Math., 2018

2017
A Distributed Proactive Service Framework for Crowd-Sensing Process.
Proceedings of the 13th IEEE International Symposium on Autonomous Decentralized System, 2017

2016
A Note on Edge-Disjoint Hamilton Cycles in Line Graphs.
Graphs Comb., 2016

Universal arcs in tournaments.
Discret. Math., 2016

Hamiltonian cycles in spanning subgraphs of line graphs.
Discret. Appl. Math., 2016

Vertex-distinguishing proper arc colorings of digraphs.
Discret. Appl. Math., 2016

2015
Vertex-disjoint cycles in bipartite tournaments.
Discret. Math., 2015

2014
Arc colorings and cycles in digraphs. (Colorations d'arc et cycles dans les graphes orientés).
PhD thesis, 2014

Complementary cycles in regular bipartite tournaments.
Discret. Math., 2014

2012
Covering the edges of digraphs in D(3, 3) and D(4, 4) with directed cuts.
Discret. Math., 2012


  Loading...