| Publication | Date of Publication | Type |
|---|
Rainbow short linear forests in edge-colored complete graph
Discrete Applied Mathematics | 2025-01-06 | Paper |
Rainbow disjoint union of \(P_4\) and a matching in complete graphs
Applied Mathematics and Computation | 2024-08-12 | Paper |
Anti-Ramsey number for perfect matchings in 3-regular bipartite graphs
Discrete Mathematics | 2024-05-21 | Paper |
Computing the anti-Ramsey number for trees in complete tripartite graph
Applied Mathematics and Computation | 2023-06-29 | Paper |
Dumbbell graphs with extremal (reverse) cover cost
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2022-12-01 | Paper |
Rainbow matchings in an edge-colored planar bipartite graph
Applied Mathematics and Computation | 2022-08-05 | Paper |
Multicolorful connectivity of trees
Applied Mathematics and Computation | 2021-11-10 | Paper |
Anti-Ramsey number of matchings in a hypergraph
Discrete Mathematics | 2021-09-30 | Paper |
The monochromatic connectivity of graphs
Taiwanese Journal of Mathematics | 2021-04-16 | Paper |
| The normalized Laplacian and related indexes of graphs with edges blew up by cliques | 2020-08-06 | Paper |
Extremal graphs with maximum monochromatic connectivity
Discrete Mathematics | 2020-07-08 | Paper |
| Kings and Kernels in Semicomplete Compositions | 2020-06-09 | Paper |
Rainbow triangles in edge-colored Kneser graphs
Applied Mathematics and Computation | 2020-01-14 | Paper |
Coupon coloring of cographs
Applied Mathematics and Computation | 2019-03-29 | Paper |
Anti-Ramsey numbers for matchings in 3-regular bipartite graphs
Applied Mathematics and Computation | 2019-03-25 | Paper |
Rainbow number of matchings in planar graphs
Discrete Mathematics | 2018-08-15 | Paper |
On \((2 k + 1, 2 k + 3)\)-core partitions with distinct parts
Discrete Mathematics | 2017-08-29 | Paper |
Anti-Ramsey numbers for matchings in regular bipartite graphs
Discrete Mathematics, Algorithms and Applications | 2017-05-23 | Paper |
Anti-Ramsey coloring for matchings in complete bipartite graphs
Journal of Combinatorial Optimization | 2017-03-03 | Paper |
An FPT algorithm for the vertex cover \(P_4\) problem
Discrete Applied Mathematics | 2016-01-21 | Paper |
A note on 2-edge-colorings of complete graphs with small monochromatic \(k\)-connected subgraphs
Applied Mathematics. Series B (English Edition) | 2015-02-11 | Paper |
| Edge-colorings of complete bipartite graphs without large rainbow trees | 2014-11-25 | Paper |
Heterochromatic tree partition number in complete multipartite graphs
Journal of Combinatorial Optimization | 2014-07-11 | Paper |
Partitioning complete graphs by heterochromatic trees
Acta Mathematicae Applicatae Sinica. English Series | 2012-12-06 | Paper |
Maximal independent sets without including any leaves in trees
International Journal of Contemporary Mathematical Sciences | 2012-08-29 | Paper |
Heterochromatic tree partition problem in complete tripartite graphs
Discrete Mathematics | 2012-04-13 | Paper |
| Trees with the second and third largest number of maximal independent sets | 2011-06-29 | Paper |
| scientific article; zbMATH DE number 5717280 (Why is no real title available?) | 2010-06-07 | Paper |
Anti-Ramsey numbers for graphs with independent cycles
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
Anti-Ramsey numbers for graphs with independent cycles
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
The second largest number of maximal independent sets in graphs with at most \(k\) cycles
Taiwanese Journal of Mathematics | 2009-11-30 | Paper |
| scientific article; zbMATH DE number 5630513 (Why is no real title available?) | 2009-11-11 | Paper |
| Integers for the number of maximal independent sets in graphs | 2009-08-04 | Paper |
Bipartite rainbow numbers of matchings
Discrete Mathematics | 2009-06-19 | Paper |
Graphs with the second largest number of maximal independent sets
Discrete Mathematics | 2009-01-28 | Paper |
Vertex partitions of \(r\)-edge-colored graphs
Applied Mathematics. Series B (English Edition) | 2008-08-06 | Paper |
Heterochromatic tree partition numbers for complete bipartite graphs
Discrete Mathematics | 2008-07-11 | Paper |
Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees
Journal of Combinatorial Optimization | 2008-04-04 | Paper |
Generalization of matching extensions in graphs. II.
Discrete Applied Mathematics | 2007-06-26 | Paper |
Contractible subgraphs ink-connected graphs
Journal of Graph Theory | 2007-06-11 | Paper |
Contractible cliques in \(k\)-connected graphs
Graphs and Combinatorics | 2007-01-05 | Paper |
On the \(k\)-path cover problem for cacti
Theoretical Computer Science | 2006-04-28 | Paper |
| Heterochromatic tree partition number of a complete multipartite graph | 2005-11-22 | Paper |
The complexity for partitioning graphs by monochromatic trees, cycles and paths
International Journal of Computer Mathematics | 2005-02-28 | Paper |
| scientific article; zbMATH DE number 2104724 (Why is no real title available?) | 2004-10-01 | Paper |
