Zemin Jin

From MaRDI portal
Person:692698

Available identifiers

zbMath Open jin.zeminMaRDI QIDQ692698

List of research outcomes





PublicationDate of PublicationType
Rainbow short linear forests in edge-colored complete graph2025-01-06Paper
Rainbow disjoint union of \(P_4\) and a matching in complete graphs2024-08-12Paper
Anti-Ramsey number for perfect matchings in 3-regular bipartite graphs2024-05-21Paper
Computing the anti-Ramsey number for trees in complete tripartite graph2023-06-29Paper
Dumbbell graphs with extremal (reverse) cover cost2022-12-01Paper
Rainbow matchings in an edge-colored planar bipartite graph2022-08-05Paper
Multicolorful connectivity of trees2021-11-10Paper
Anti-Ramsey number of matchings in a hypergraph2021-09-30Paper
The monochromatic connectivity of graphs2021-04-16Paper
The normalized Laplacian and related indexes of graphs with edges blew up by cliques2020-08-06Paper
Extremal graphs with maximum monochromatic connectivity2020-07-08Paper
Kings and Kernels in Semicomplete Compositions2020-06-09Paper
Rainbow triangles in edge-colored Kneser graphs2020-01-14Paper
Coupon coloring of cographs2019-03-29Paper
Anti-Ramsey numbers for matchings in 3-regular bipartite graphs2019-03-25Paper
Rainbow number of matchings in planar graphs2018-08-15Paper
On \((2 k + 1, 2 k + 3)\)-core partitions with distinct parts2017-08-29Paper
Anti-Ramsey numbers for matchings in regular bipartite graphs2017-05-23Paper
Anti-Ramsey coloring for matchings in complete bipartite graphs2017-03-03Paper
An FPT algorithm for the vertex cover \(P_4\) problem2016-01-21Paper
A note on 2-edge-colorings of complete graphs with small monochromatic \(k\)-connected subgraphs2015-02-11Paper
https://portal.mardi4nfdi.de/entity/Q29314712014-11-25Paper
Heterochromatic tree partition number in complete multipartite graphs2014-07-11Paper
Partitioning complete graphs by heterochromatic trees2012-12-06Paper
Maximal independent sets without including any leaves in trees2012-08-29Paper
Heterochromatic tree partition problem in complete tripartite graphs2012-04-13Paper
https://portal.mardi4nfdi.de/entity/Q30118212011-06-29Paper
https://portal.mardi4nfdi.de/entity/Q35659542010-06-07Paper
Anti-Ramsey numbers for graphs with independent cycles2010-03-26Paper
The second largest number of maximal independent sets in graphs with at most \(k\) cycles2009-11-30Paper
https://portal.mardi4nfdi.de/entity/Q36411112009-11-11Paper
https://portal.mardi4nfdi.de/entity/Q51922512009-08-04Paper
Bipartite rainbow numbers of matchings2009-06-19Paper
Graphs with the second largest number of maximal independent sets2009-01-28Paper
Vertex partitions of \(r\)-edge-colored graphs2008-08-06Paper
Heterochromatic tree partition numbers for complete bipartite graphs2008-07-11Paper
Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees2008-04-04Paper
Generalization of matching extensions in graphs. II.2007-06-26Paper
Contractible subgraphs ink-connected graphs2007-06-11Paper
Contractible cliques in \(k\)-connected graphs2007-01-05Paper
On the \(k\)-path cover problem for cacti2006-04-28Paper
Heterochromatic tree partition number of a complete multipartite graph2005-11-22Paper
The complexity for partitioning graphs by monochromatic trees, cycles and paths2005-02-28Paper
https://portal.mardi4nfdi.de/entity/Q48187932004-10-01Paper

Research outcomes over time

This page was built for person: Zemin Jin