Zemin Jin

Rui Yu

Discret. Appl. Math., March, 2024

2023

Semicomplete compositions of digraphs.

[BibT_eX]

[DOI]

Discret. Math., August, 2023

Computing the anti-Ramsey number for trees in complete tripartite graph.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2023

2022

Minimally strong subgraph (k, ℓ)-arc-connected digraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2022

Rainbow matchings in an edge-colored planar bipartite graph.

[BibT_eX]

[DOI]

Huawei Ma

Rui Yu

Appl. Math. Comput., 2022

2021

Anti-Ramsey Number of Triangles in Complete Multipartite Graphs.

[BibT_eX]

[DOI]

Kangyun Zhong

Graphs Comb., 2021

The minimum size of a graph with given tree connectivity.

[BibT_eX]

[DOI]

Bin Sheng

Discuss. Math. Graph Theory, 2021

Anti-Ramsey number of matchings in a hypergraph.

[BibT_eX]

[DOI]

Discret. Math., 2021

Multicolorful connectivity of trees.

[BibT_eX]

[DOI]

Xueyao Gui

Kaijun Wang

Appl. Math. Comput., 2021

2020

Extremal graphs with maximum monochromatic connectivity.

[BibT_eX]

[DOI]

Yirong Yang

Discret. Math., 2020

Rainbow triangles in edge-colored Kneser graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2020

2018

Rainbow matchings in edge-colored complete split graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

Rainbow total-coloring of complementary graphs and Erdös-Gallai type problem for the rainbow total-connection number.

[BibT_eX]

[DOI]

Jianhua Tu

Discuss. Math. Graph Theory, 2018

On two generalized connectivities of graphs.

[BibT_eX]

[DOI]

Fengwei Li

Discuss. Math. Graph Theory, 2018

Large rainbow matchings in semi-strong edge-colorings of graphs.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2018

Rainbow number of matchings in planar graphs.

[BibT_eX]

[DOI]

Kun Ye

Discret. Math., 2018

2017

Anti-Ramsey coloring for matchings in complete bipartite graphs.

[BibT_eX]

[DOI]

Yuping Zang

J. Comb. Optim., 2017

Extremal coloring for the anti-Ramsey problem of matchings in complete graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Anti-Ramsey numbers for matchings in regular bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2017

On (2k+1, 2k+3)-core partitions with distinct parts.

[BibT_eX]

[DOI]

Discret. Math., 2017

On total rainbow k-connected graphs.

[BibT_eX]

[DOI]

Fengwei Li

Appl. Math. Comput., 2017

Anti-Ramsey numbers for matchings in 3-regular bipartite graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2017

Coupon coloring of cographs.

[BibT_eX]

[DOI]

He Chen

Appl. Math. Comput., 2017

2016

An FPT algorithm for the vertex cover P4 problem.

[BibT_eX]

[DOI]

Jianhua Tu

Discret. Appl. Math., 2016

2014

Heterochromatic tree partition number in complete multipartite graphs.

[BibT_eX]

[DOI]

Peipei Zhu

J. Comb. Optim., 2014

2013

Edge-colorings of complete bipartite graphs without large rainbow trees.

[BibT_eX]

Lifen Li

Ars Comb., 2013

2012

Heterochromatic tree partition problem in complete tripartite graphs.

[BibT_eX]

[DOI]

Shili Wen

Shujun Zhou

Discret. Math., 2012

2009

Bipartite rainbow numbers of matchings.

[BibT_eX]

[DOI]

Jianhua Tu

Discret. Math., 2009

Anti-Ramsey Numbers for Graphs with Independent Cycles.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

Trees with the second and third largest number of maximal independent sets.

[BibT_eX]

Sherry H. F. Yan

Ars Comb., 2009

2008

Graphs with the second largest number of maximal independent sets.

[BibT_eX]

[DOI]

Discret. Math., 2008

Heterochromatic tree partition numbers for complete bipartite graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

2007

Contractible subgraphs in k-connected graphs.

[BibT_eX]

[DOI]

Xingxing Yu

Xiaoyan Zhang

J. Graph Theory, 2007

Generalization of matching extensions in graphs (II).

[BibT_eX]

[DOI]

Huifang Yan

Qinglin Yu

Discret. Appl. Math., 2007

2006

On the k-path cover problem for cacti.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees.

[BibT_eX]

[DOI]

J. Comb. Optim., 2006

Contractible Cliques in k-Connected Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2006

2004

The complexity for partitioning graphs by monochromatic trees, cycles and paths.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2004

On a conjecture on k-walks of graphs.

[BibT_eX]

[DOI]