Jin Yan

From MaRDI portal
Person:343779

Available identifiers

zbMath Open yan.jinMaRDI QIDQ343779

List of research outcomes





PublicationDate of PublicationType
A characterization of rich \(c\)-partite \((c \geq 7)\) tournaments without \((c + 2)\)-cycles2024-09-06Paper
Cycle-factors in oriented graphs2024-07-02Paper
Adaptive constrained output feedback optimal consensus tracking for uncertain nonlinear multi-agent systems and its application2024-05-21Paper
Spanning 3-strong tournaments in 5-strong semicomplete digraphs2023-10-30Paper
Vertex‐disjoint cycles of the same length in tournaments2023-10-09Paper
Transition to anomalous dynamics in a simple random map2023-08-17Paper
Disjoint cycles covering specified vertices in bipartite graphs with partial degrees2023-05-31Paper
Partition and disjoint cycles in digraphs2023-04-24Paper
Improved results on linkage problems2023-04-20Paper
Disjoint Cycles in a Digraph with Partial Degree2023-03-30Paper
Lower bounds of distance Laplacian spectral radii of \(n\)-vertex graphs in terms of fractional matching number2023-03-07Paper
Serrin-Type Overdetermined Problem in $\mathbb H^n$2023-03-06Paper
Disjoint cycles with partial degree conditions in claw-free graphs2022-11-23Paper
Cycle extendability in extended tournaments2022-06-29Paper
On disjoint cycles of the same length in tournaments2022-04-14Paper
Note on distance signless Laplacian spectral radius under given matching number2022-04-08Paper
Partitioning a graph into cycles with a specified number of chords2022-03-31Paper
Nonlinear dynamics of coupled axion-Josephson junction systems2022-03-15Paper
Disjoint cycles and \(2\)-factors with Fan-type condition in a graph2022-02-14Paper
Serrin-type Overdetermined problems in $\mathbb H^n$2022-01-12Paper
Vertex-disjoint stars in \(K_{1 , r}\)-free graphs2021-08-02Paper
Vertex disjoint copies of \(K_{1 , 4}\) in claw-free graphs2021-04-14Paper
Packing a number of copies of a \(( p , q )\)-graph2020-12-29Paper
Lichiardopol's conjecture on disjoint cycles in tournaments2020-06-15Paper
Distinguished correlation properties of Chebyshev dynamical systems and their generalisations2020-06-11Paper
On directed version of the Sauer-Spender Theorem2020-01-31Paper
An improvement of Lichiardopol's theorem on disjoint cycles in tournaments2019-11-26Paper
Semiparametric estimation of the random utility model with rank-ordered choice data2019-07-01Paper
Longitudinal Aircraft Dynamics and the Instantaneous Acceleration Center of Rotation2018-09-14Paper
Time-Domain Method Having a Naturally Diagonal Mass Matrix Independent of Element Shape for General Electromagnetic Analysis—2-D Formulations2018-09-14Paper
The confirmation of a conjecture on disjoint cycles in a graph2018-08-15Paper
Degree sum conditions on two disjoint cycles in graphs2018-07-17Paper
https://portal.mardi4nfdi.de/entity/Q45681852018-06-15Paper
Disjoint cliques in claw-free graphs2018-04-05Paper
On the number of disjoint 4-cycles in regular tournaments2018-03-23Paper
Fan-type condition on disjoint cycles in a graph2018-02-23Paper
Partial degree conditions and cycle coverings in bipartite graphs2017-10-11Paper
Disjoint cycles in graphs with distance degree sum conditions2017-08-29Paper
https://portal.mardi4nfdi.de/entity/Q52730732017-07-05Paper
Vertex-disjoint copies of \(K_{1, t}\) in \(K_{1, r}\)-free graphs2017-02-06Paper
Vertex-disjoint cycles containing specified vertices in a bipartite graph2016-11-29Paper
Vertex-disjoint copies of \(K_{1,3}\) in \(K_{1,r}\)-free graphs2016-08-16Paper
图中相互独立的4-圈和8-圈2015-10-28Paper
https://portal.mardi4nfdi.de/entity/Q31944532015-10-28Paper
https://portal.mardi4nfdi.de/entity/Q29480662015-09-29Paper
Minimum modelling retrospective cost adaptive control of uncertain Hammerstein systems using auxiliary nonlinearities2015-07-28Paper
https://portal.mardi4nfdi.de/entity/Q52602972015-06-29Paper
Graph partition into small cliques2014-09-12Paper
https://portal.mardi4nfdi.de/entity/Q53972882014-02-19Paper
Neighborhood unions for the existence of disjoint chorded cycles in graphs2013-09-26Paper
Contractible configurations on 3-flows in graphs satisfying the Fan-condition2013-03-19Paper
A vertex cover with chorded 4-cycles2013-03-18Paper
Degree conditions for the partition of a graph into triangles and guadrilaterals2012-07-02Paper
On 2-factors with chorded quadrilaterals in graphs.2012-04-03Paper
Nowhere-zero 3-flows and \(Z_{3}\)-connectivity of a family of graphs2011-08-09Paper
https://portal.mardi4nfdi.de/entity/Q30097442011-06-24Paper
Every 3‐connected claw‐free Z 8 ‐free graph is Hamiltonian2010-11-10Paper
Graph partition into \(K_{3}\)s and \(K_{4}\)s2010-10-26Paper
Vertex-disjoint triangles in \(K_{1,t}\)-free graphs with minimum degree at least \(t\)2010-10-11Paper
Integer Exact Network Synthesis Problem2010-03-17Paper
On Enomoto's problems in a bipartite graph2009-12-11Paper
On 2-factors with cycles containing specified vertices in a bipartite graph2009-11-09Paper
On 2-factors with cycles containing specified edges in a bipartite graph2009-04-09Paper
https://portal.mardi4nfdi.de/entity/Q36110902009-03-06Paper
Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph2008-10-21Paper
Disjoint triangles and quadrilaterals in a graph2008-07-11Paper
An improved lower bound for a bi-criteria scheduling problem2008-05-29Paper
https://portal.mardi4nfdi.de/entity/Q54394082008-02-11Paper
https://portal.mardi4nfdi.de/entity/Q54394092008-02-11Paper
Determining plastic properties of a material with residual stress by using conical indentation2007-10-09Paper
https://portal.mardi4nfdi.de/entity/Q53102452007-09-21Paper
On 2-factors with prescribed properties in a bipartite graph2006-10-13Paper
Vertex-disjoint quadrilaterals in bipartite graphs2005-11-21Paper
https://portal.mardi4nfdi.de/entity/Q46796612005-06-21Paper
https://portal.mardi4nfdi.de/entity/Q46534302005-03-07Paper
https://portal.mardi4nfdi.de/entity/Q44553262004-03-16Paper
https://portal.mardi4nfdi.de/entity/Q48019842003-06-01Paper
A characterization of rich c-partite (c > 7) tournaments without (c + 2)-cyclesN/APaper
A Dirac-type theorem for arbitrary Hamiltonian $H$-linked digraphsN/APaper
The generalizations of Hamiltonian in oriented graphsN/APaper
Cycle-factors in oriented graphsN/APaper
Removal paths avoiding verticesN/APaper
Bipartitions with prescribed order of highly connected digraphsN/APaper

Research outcomes over time

This page was built for person: Jin Yan