Yandong Bai

From MaRDI portal
Person:2013124

Available identifiers

zbMath Open bai.yandongMaRDI QIDQ2013124

List of research outcomes





PublicationDate of PublicationType
Safe sets and in-dominating sets in digraphs2024-02-14Paper
Properly colored cycles of different lengths in edge-colored complete graphs2023-10-04Paper
Uniform hypergraphs under certain intersection constraints between hyperedges2023-08-09Paper
Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs2023-03-07Paper
Sufficient conditions for properly colored \(C_3\)'s and \(C_4\)'s in edge-colored complete graphs2023-01-11Paper
Characterizing and recognizing exact-distance squares of graphs2022-11-04Paper
Connected \(k\)-factors in bipartite graphs2022-11-02Paper
Edge-colored complete graphs containing no properly colored odd cycles2021-08-12Paper
Rainbow triangles in arc-colored tournaments2021-07-28Paper
Kernels by rainbow paths in arc-colored tournaments2020-06-05Paper
On the Number of Vertex-Disjoint Cycles in Digraphs2019-12-11Paper
Safe sets in digraphs2019-08-19Paper
Uniform sets in a family with restricted intersections2018-11-28Paper
A note on hypergraph colorings2018-08-12Paper
On splitting digraphs2018-05-18Paper
Kernels by properly colored paths in arc-colored digraphs2018-04-19Paper
Linear arboricity of regular digraphs2017-08-03Paper
Vertex-distinguishing proper arc colorings of digraphs2016-06-21Paper
Hamiltonian cycles in spanning subgraphs of line graphs2016-06-21Paper
A note on edge-disjoint Hamilton cycles in line graphs2016-06-13Paper
Universal arcs in tournaments2016-05-18Paper
Vertex-disjoint cycles in bipartite tournaments2015-04-29Paper
Complementary cycles in regular bipartite tournaments2014-08-21Paper
Covering the edges of digraphs in \(\mathcal D(3,3)\) and \(\mathcal D(4,4)\) with directed cuts2012-05-30Paper
Vertex-disjoint cycles of different lengths in tournamentsN/APaper

Research outcomes over time

This page was built for person: Yandong Bai