| Publication | Date of Publication | Type |
|---|
Estimation of domination number of graphs via safe number
The Australasian Journal of Combinatorics | 2026-02-12 | Paper |
Bip-ordered bipartite Ramsey number
Discrete Applied Mathematics | 2026-02-11 | Paper |
Sufficient conditions for edge-colored bipartite graphs to have rainbow and properly colored spanning trees
Discrete Mathematics | 2026-01-15 | Paper |
Connectivity keeping paths containing prescribed vertices in highly connected triangle-free graphs
Journal of Combinatorial Theory. Series B | 2025-07-29 | Paper |
Monochromatic \(k\)-connection of graphs
Discrete Applied Mathematics | 2024-12-04 | Paper |
Safe sets and in-dominating sets in digraphs
Discrete Applied Mathematics | 2024-02-14 | Paper |
Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph
Graphs and Combinatorics | 2023-03-09 | Paper |
| Stable structure on safe set problems in vertex-weighted graphs. II: Recognition and complexity | 2022-12-21 | Paper |
| New classification of graphs in view of the domination number of central graphs | 2022-04-20 | Paper |
On properly ordered coloring of vertices in a vertex-weighted graph
Order | 2021-11-19 | Paper |
On properly ordered coloring of vertices in a vertex-weighted graph
Order | 2021-11-19 | Paper |
The optimal proper connection number of a graph with given independence number
Discrete Optimization | 2021-10-19 | Paper |
Stable structure on safe set problems in vertex-weighted graphs
European Journal of Combinatorics | 2021-02-08 | Paper |
Optimal proper connection of graphs
Optimization Letters | 2020-08-24 | Paper |
Decomposing edge-coloured graphs under colour degree constraints
Combinatorics, Probability and Computing | 2020-04-06 | Paper |
| Safe sets in digraphs | 2019-08-19 | Paper |
Safe sets, network majority on weighted trees
Networks | 2019-08-12 | Paper |
On sufficient conditions for rainbow cycles in edge-colored graphs
Discrete Mathematics | 2019-06-18 | Paper |
On the weighted safe set problem on paths and cycles
Journal of Combinatorial Optimization | 2019-06-06 | Paper |
On the weighted safe set problem on paths and cycles
Journal of Combinatorial Optimization | 2019-06-06 | Paper |
General upper bounds on independent \(k\)-rainbow domination
Discrete Applied Mathematics | 2019-03-22 | Paper |
International competition and distributive class conflict in an open economy Kaleckian model
Metroeconomica | 2019-02-07 | Paper |
A new approach towards a conjecture on intersecting three longest paths
Journal of Combinatorics | 2019-01-28 | Paper |
Safe sets in graphs: graph classes and structural parameters
Journal of Combinatorial Optimization | 2018-12-06 | Paper |
Safe number and integrity of graphs
Discrete Applied Mathematics | 2018-09-06 | Paper |
Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs
Journal of Graph Theory | 2018-04-27 | Paper |
Kernels by properly colored paths in arc-colored digraphs
Discrete Mathematics | 2018-04-19 | Paper |
Bounding the distance among longest paths in a connected graph
Discrete Mathematics | 2018-02-23 | Paper |
Bounding the distance among longest paths in a connected graph
Discrete Mathematics | 2018-02-23 | Paper |
Decomposing edge-colored graphs under color degree constraints
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
| Network majority on tree topological network | 2017-02-13 | Paper |
Vertex-disjoint copies of \(K_{1, t}\) in \(K_{1, r}\)-free graphs
Discrete Mathematics | 2017-02-06 | Paper |
Safe sets in graphs: graph classes and structural parameters
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Safe set problem on graphs
Discrete Applied Mathematics | 2016-10-07 | Paper |
Partitioning a graph into highly connected subgraphs
Journal of Graph Theory | 2016-08-12 | Paper |
Non-separating subgraphs in highly connected graphs
Journal of Combinatorial Theory. Series B | 2016-01-28 | Paper |
| scientific article; zbMATH DE number 6470879 (Why is no real title available?) | 2015-08-05 | Paper |
General bounds on rainbow domination numbers
Graphs and Combinatorics | 2015-05-22 | Paper |
Downhill domination problem in graphs
Information Processing Letters | 2015-05-21 | Paper |
Pebble exchange on graphs
Discrete Applied Mathematics | 2015-04-28 | Paper |
From edge-coloring to strong edge-coloring
The Electronic Journal of Combinatorics | 2015-04-22 | Paper |
A note on covering edge colored hypergraphs by monochromatic components
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
A connected subgraph maintaining high connectivity
European Journal of Combinatorics | 2014-07-29 | Paper |
Revisit of Erdős-Gallai's theorem on the circumference of a graph
Information Processing Letters | 2014-04-11 | Paper |
On diameter and inverse degree of chemical graphs
Applicable Analysis and Discrete Mathematics | 2014-03-26 | Paper |
Minimum degree conditions for vertex-disjoint even cycles in large graphs
Advances in Applied Mathematics | 2014-03-25 | Paper |
Forbidden subgraphs generating almost the same sets
Combinatorics, Probability and Computing | 2014-02-24 | Paper |
Rainbow domination numbers on graphs with given radius
Discrete Applied Mathematics | 2014-02-18 | Paper |
Forbidden rainbow subgraphs that force large highly connected monochromatic subgraphs
SIAM Journal on Discrete Mathematics | 2014-01-21 | Paper |
The importance of the retention ratio in a Kaleckian model with debt accumulation
Metroeconomica | 2013-12-03 | Paper |
The balanced decomposition number of \({TK}_4\) and series-parallel graphs
Discussiones Mathematicae. Graph Theory | 2013-11-11 | Paper |
| Rainbow k-connection in dense graphs (extended abstract) | 2013-11-01 | Paper |
| High connectivity keeping connected subgraph | 2013-11-01 | Paper |
Disjoint even cycles packing
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Colored pebble motion on graphs (extended abstract)
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Disconnected colors in generalized Gallai-colorings
Journal of Graph Theory | 2013-10-09 | Paper |
Proper connection with many colors
Journal of Combinatorics | 2013-06-25 | Paper |
Difference between 2-rainbow domination and roman domination in graphs
Discrete Applied Mathematics | 2013-04-18 | Paper |
Covering vertices by a specified number of disjoint cycles, edges and isolated vertices
Discrete Mathematics | 2013-01-03 | Paper |
| Around a biclique cover conjecture | 2012-12-31 | Paper |
Partition of graphs and hypergraphs into monochromatic connected parts
The Electronic Journal of Combinatorics | 2012-10-24 | Paper |
Extensions of Gallai-Ramsey results
Journal of Graph Theory | 2012-08-31 | Paper |
Proper connection of graphs
Discrete Mathematics | 2012-08-10 | Paper |
Generalized Ramsey numbers for graphs with three disjoint cycles versus a complete graph
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
k-rainbow domatic numbers
Discrete Applied Mathematics | 2012-05-30 | Paper |
Colored pebble motion on graphs
European Journal of Combinatorics | 2012-05-04 | Paper |
Constructing connected bicritical graphs with edge-connectivity 2
Discrete Applied Mathematics | 2012-05-04 | Paper |
A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity
Combinatorica | 2012-04-26 | Paper |
Contractible triples in highly connected graphs
Annals of Combinatorics | 2012-01-24 | Paper |
Minimally contraction-critically 6-connected graphs
Discrete Mathematics | 2012-01-11 | Paper |
Non-separating even cycles in highly connected graphs
Combinatorica | 2011-12-19 | Paper |
Properly colored paths and cycles
Discrete Applied Mathematics | 2011-10-27 | Paper |
Long path lemma concerning connectivity and independence number
The Electronic Journal of Combinatorics | 2011-07-29 | Paper |
Long path lemma concerning connectivity and independence number
The Electronic Journal of Combinatorics | 2011-07-29 | Paper |
Independence number and disjoint theta graphs
The Electronic Journal of Combinatorics | 2011-07-29 | Paper |
Independence number and disjoint theta graphs
The Electronic Journal of Combinatorics | 2011-07-29 | Paper |
Gallai-Ramsey numbers for cycles
Discrete Mathematics | 2011-05-31 | Paper |
Some remarks on long monochromatic cycles in edge-colored complete graphs
Discrete Mathematics | 2011-05-06 | Paper |
Note on highly connected monochromatic subgraphs in 2-colored complete graphs
The Electronic Journal of Combinatorics | 2011-02-17 | Paper |
Note on highly connected monochromatic subgraphs in 2-colored complete graphs
The Electronic Journal of Combinatorics | 2011-02-17 | Paper |
Rainbow generalizations of Ramsey theory: A survey
Graphs and Combinatorics | 2010-11-12 | Paper |
On a sharp degree sum condition for disjoint chorded cycles in graphs
Graphs and Combinatorics | 2010-11-12 | Paper |
Contractible small subgraphs in \(k\)-connected graphs
Graphs and Combinatorics | 2010-11-12 | Paper |
A rainbow \(k\)-matching in the complete graph with \(r\) colors
The Electronic Journal of Combinatorics | 2009-07-08 | Paper |
A rainbow \(k\)-matching in the complete graph with \(r\) colors
The Electronic Journal of Combinatorics | 2009-07-08 | Paper |
Degree conditions for the partition of a graph into cycles, edges and isolated vertices
Discrete Mathematics | 2009-06-19 | Paper |
On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs
Tokyo Journal of Mathematics | 2009-04-21 | Paper |
Balanced decomposition of a vertex-colored graph
Discrete Applied Mathematics | 2009-03-04 | Paper |
Note on non-separating and removable cycles in highly connected graphs
Discrete Applied Mathematics | 2009-03-04 | Paper |
\(K_{1,3}\)-factors in graphs
Discrete Mathematics | 2009-01-28 | Paper |
| Extremal problems concerning the existence of vertex-disjoint subgraphs | 2008-10-20 | Paper |
Connectivity keeping edges in graphs with large minimum degree
Journal of Combinatorial Theory. Series B | 2008-07-24 | Paper |
Contractible elements ink-connected graphs not containing some specified graphs
Journal of Graph Theory | 2008-06-12 | Paper |
Vertex-disjoint copies of \(K_{1}+(K_{1} \cup K_{2}\)) in claw-free graphs
Discrete Mathematics | 2008-03-13 | Paper |
Edge-dominating cycles in graphs
Discrete Mathematics | 2007-11-30 | Paper |
Disjoint stars and forbidden subgraphs
Hiroshima Mathematical Journal | 2007-08-20 | Paper |
Recent Results on Disjoint Cycles in Graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
On graphs G for which both G and G are claw-free
Discussiones Mathematicae Graph Theory | 2006-10-16 | Paper |
| Degree sum conditions and vertex-disjoint cycles in a graph | 2006-08-03 | Paper |
A pair of forbidden subgraphs and perfect matchings.
Journal of Combinatorial Theory. Series B | 2006-05-18 | Paper |
Existence of two disjoint long cycles in graphs
Discrete Mathematics | 2006-01-10 | Paper |
| scientific article; zbMATH DE number 2202192 (Why is no real title available?) | 2005-09-05 | Paper |
| scientific article; zbMATH DE number 2188446 (Why is no real title available?) | 2005-07-26 | Paper |
| scientific article; zbMATH DE number 2186975 (Why is no real title available?) | 2005-07-13 | Paper |
Heavy cycles in Hamiltonian weighted graphs
AKCE International Journal of Graphs and Combinatorics | 2005-05-03 | Paper |
| scientific article; zbMATH DE number 2147939 (Why is no real title available?) | 2005-03-21 | Paper |
| scientific article; zbMATH DE number 1926043 (Why is no real title available?) | 2004-02-08 | Paper |
Monochromatic $k$-connection of graphs
(available as arXiv preprint) | N/A | Paper |
