Yandong Bai

From MaRDI portal
(Redirected from Yandong Bai)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Vertex-disjoint cycles of different lengths in tournaments
(available as arXiv preprint)
N/APaper
Agreeing families
Discrete Applied Mathematics
2026-09-18Paper
Cycle lengths in graphs of given minimum degree
Journal of Combinatorial Theory. Series B
2026-07-31Paper
The parameterized complexity of the properly colored spanning tree problem
Discrete Applied Mathematics
2026-07-28Paper
Properly colored cycles in edge-colored balanced bipartite graphs
Journal of Graph Theory
2026-05-05Paper
Cross-intersecting families with covering number constraints
(available as arXiv preprint)
2026-01-01Paper
On 2-connected graphs without cycles of length 1 modulo 3
(available as arXiv preprint)
2026-01-01Paper
Typical intersecting families are trivial
(available as arXiv preprint)
2026-01-01Paper
Towards a strengthening of the second neighborhood conjecture
(available as arXiv preprint)
2026-01-01Paper
On graphs without cycles of length 1 modulo 3
(available as arXiv preprint)
2025-01-01Paper
Cycle lengths in graphs of given minimum degree
(available as arXiv preprint)
2025-01-01Paper
Safe sets and in-dominating sets in digraphs
Discrete Applied Mathematics
2024-02-14Paper
Properly colored cycles of different lengths in edge-colored complete graphs
Discrete Mathematics
2023-10-04Paper
Uniform hypergraphs under certain intersection constraints between hyperedges
Acta Mathematica Sinica, English Series
2023-08-09Paper
Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs
Journal of Combinatorial Optimization
2023-03-07Paper
Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs
Discrete Applied Mathematics
2023-01-11Paper
Characterizing and recognizing exact-distance squares of graphs2022-11-04Paper
Connected \(k\)-factors in bipartite graphs
Discrete Mathematics
2022-11-02Paper
Edge-colored complete graphs containing no properly colored odd cycles
Graphs and Combinatorics
2021-08-12Paper
Rainbow triangles in arc-colored tournaments
Graphs and Combinatorics
2021-07-28Paper
Kernels by rainbow paths in arc-colored tournaments
Discrete Applied Mathematics
2020-06-05Paper
On the number of vertex-disjoint cycles in digraphs
SIAM Journal on Discrete Mathematics
2019-12-11Paper
Safe sets in digraphs2019-08-19Paper
Safe sets in digraphs
(available as arXiv preprint)
2019-01-01Paper
Uniform sets in a family with restricted intersections2018-11-28Paper
A note on hypergraph colorings2018-08-12Paper
On splitting digraphs
European Journal of Combinatorics
2018-05-18Paper
Kernels by properly colored paths in arc-colored digraphs
Discrete Mathematics
2018-04-19Paper
Kernels by rainbow paths in arc-colored tournaments
(available as arXiv preprint)
2018-01-01Paper
A note on hypergraph colorings
(available as arXiv preprint)
2018-01-01Paper
Uniform sets in a family with restricted intersections
(available as arXiv preprint)
2018-01-01Paper
Linear arboricity of regular digraphs
Acta Mathematica Sinica, English Series
2017-08-03Paper
Vertex-distinguishing proper arc colorings of digraphs
Discrete Applied Mathematics
2016-06-21Paper
Hamiltonian cycles in spanning subgraphs of line graphs
Discrete Applied Mathematics
2016-06-21Paper
A note on edge-disjoint Hamilton cycles in line graphs
Graphs and Combinatorics
2016-06-13Paper
Universal arcs in tournaments
Discrete Mathematics
2016-05-18Paper
Vertex-disjoint cycles in bipartite tournaments
Discrete Mathematics
2015-04-29Paper
Complementary cycles in regular bipartite tournaments
Discrete Mathematics
2014-08-21Paper
Covering the edges of digraphs in \(\mathcal D(3,3)\) and \(\mathcal D(4,4)\) with directed cuts
Discrete Mathematics
2012-05-30Paper


Research outcomes over time


This page was built for person: Yandong Bai