Publication | Date of Publication | Type |
---|
Safe sets and in-dominating sets in digraphs | 2024-02-14 | Paper |
Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph | 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 | 2021-11-19 | Paper |
The optimal proper connection number of a graph with given independence number | 2021-10-19 | Paper |
Stable structure on safe set problems in vertex-weighted graphs | 2021-02-08 | Paper |
Optimal proper connection of graphs | 2020-08-24 | Paper |
Decomposing edge-colored graphs under color degree constraints | 2020-04-06 | Paper |
Safe sets in digraphs | 2019-08-19 | Paper |
Safe sets, network majority on weighted trees | 2019-08-12 | Paper |
On sufficient conditions for rainbow cycles in edge-colored graphs | 2019-06-18 | Paper |
On the weighted safe set problem on paths and cycles | 2019-06-06 | Paper |
General upper bounds on independent \(k\)-rainbow domination | 2019-03-22 | Paper |
International Competition and Distributive Class Conflict in an Open Economy <scp>K</scp>aleckian Model | 2019-02-07 | Paper |
A new approach towards a conjecture on intersecting three longest paths | 2019-01-28 | Paper |
Safe sets in graphs: graph classes and structural parameters | 2018-12-06 | Paper |
Safe number and integrity of graphs | 2018-09-06 | Paper |
Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs | 2018-04-27 | Paper |
Kernels by properly colored paths in arc-colored digraphs | 2018-04-19 | Paper |
Bounding the distance among longest paths in a connected graph | 2018-02-23 | Paper |
Decomposing edge-colored graphs under color degree constraints | 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 | 2017-02-06 | Paper |
Safe Sets in Graphs: Graph Classes and Structural Parameters | 2017-02-01 | Paper |
Safe set problem on graphs | 2016-10-07 | Paper |
Partitioning a Graph into Highly Connected Subgraphs | 2016-08-12 | Paper |
Non-separating subgraphs in highly connected graphs | 2016-01-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q5500314 | 2015-08-05 | Paper |
General bounds on rainbow domination numbers | 2015-05-22 | Paper |
Downhill domination problem in graphs | 2015-05-21 | Paper |
Pebble exchange on graphs | 2015-04-28 | Paper |
From edge-coloring to strong edge-coloring | 2015-04-22 | Paper |
A note on covering edge colored hypergraphs by monochromatic components | 2014-09-04 | Paper |
A connected subgraph maintaining high connectivity | 2014-07-29 | Paper |
Revisit of Erdős-Gallai's theorem on the circumference of a graph | 2014-04-11 | Paper |
On diameter and inverse degree of chemical graphs | 2014-03-26 | Paper |
Minimum degree conditions for vertex-disjoint even cycles in large graphs | 2014-03-25 | Paper |
Forbidden Subgraphs Generating Almost the Same Sets | 2014-02-24 | Paper |
Rainbow domination numbers on graphs with given radius | 2014-02-18 | Paper |
Forbidden Rainbow Subgraphs That Force Large Highly Connected Monochromatic Subgraphs | 2014-01-21 | Paper |
THE IMPORTANCE OF THE RETENTION RATIO IN A KALECKIAN MODEL WITH DEBT ACCUMULATION | 2013-12-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q2857371 | 2013-11-01 | Paper |
Disjoint Even Cycles Packing | 2013-10-10 | Paper |
Colored Pebble Motion on Graphs (Extended Abstract) | 2013-10-10 | Paper |
Disconnected Colors in Generalized Gallai-Colorings | 2013-10-09 | Paper |
Proper connection with many colors | 2013-06-25 | Paper |
Difference between 2-rainbow domination and roman domination in graphs | 2013-04-18 | Paper |
Covering vertices by a specified number of disjoint cycles, edges and isolated vertices | 2013-01-03 | Paper |
Around a biclique cover conjecture | 2012-12-31 | Paper |
Partition of graphs and hypergraphs into monochromatic connected parts | 2012-10-24 | Paper |
Extensions of Gallai-Ramsey results | 2012-08-31 | Paper |
Proper connection of graphs | 2012-08-10 | Paper |
Generalized Ramsey numbers for graphs with three disjoint cycles versus a complete graph | 2012-06-12 | Paper |
\(k\)-rainbow domatic numbers | 2012-05-30 | Paper |
Colored pebble motion on graphs | 2012-05-04 | Paper |
Constructing connected bicritical graphs with edge-connectivity 2 | 2012-05-04 | Paper |
A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity | 2012-04-26 | Paper |
Contractible triples in highly connected graphs | 2012-01-24 | Paper |
Minimally contraction-critically 6-connected graphs | 2012-01-11 | Paper |
Non-separating even cycles in highly connected graphs | 2011-12-19 | Paper |
Properly colored paths and cycles | 2011-10-27 | Paper |
Long path lemma concerning connectivity and independence number | 2011-07-29 | Paper |
Independence number and disjoint theta graphs | 2011-07-29 | Paper |
Gallai-Ramsey numbers for cycles | 2011-05-31 | Paper |
Some remarks on long monochromatic cycles in edge-colored complete graphs | 2011-05-06 | Paper |
Note on highly connected monochromatic subgraphs in 2-colored complete graphs | 2011-02-17 | Paper |
Rainbow generalizations of Ramsey theory: A survey | 2010-11-12 | Paper |
On a sharp degree sum condition for disjoint chorded cycles in graphs | 2010-11-12 | Paper |
Contractible small subgraphs in \(k\)-connected graphs | 2010-11-12 | Paper |
A rainbow \(k\)-matching in the complete graph with \(r\) colors | 2009-07-08 | Paper |
Degree conditions for the partition of a graph into cycles, edges and isolated vertices | 2009-06-19 | Paper |
On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs | 2009-04-21 | Paper |
Note on non-separating and removable cycles in highly connected graphs | 2009-03-04 | Paper |
Balanced decomposition of a vertex-colored graph | 2009-03-04 | Paper |
\(K_{1,3}\)-factors in graphs | 2009-01-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q3530461 | 2008-10-20 | Paper |
Connectivity keeping edges in graphs with large minimum degree | 2008-07-24 | Paper |
Contractible elements ink-connected graphs not containing some specified graphs | 2008-06-12 | Paper |
Vertex-disjoint copies of \(K_{1}+(K_{1} \cup K_{2}\)) in claw-free graphs | 2008-03-13 | Paper |
Edge-dominating cycles in graphs | 2007-11-30 | Paper |
Disjoint stars and forbidden subgraphs | 2007-08-20 | Paper |
Recent Results on Disjoint Cycles in Graphs | 2007-05-29 | Paper |
On graphs G for which both G and G are claw-free | 2006-10-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q5480718 | 2006-08-03 | Paper |
A pair of forbidden subgraphs and perfect matchings. | 2006-05-18 | Paper |
Existence of two disjoint long cycles in graphs | 2006-01-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q5314409 | 2005-09-05 | Paper |
https://portal.mardi4nfdi.de/entity/Q5461552 | 2005-07-26 | Paper |
https://portal.mardi4nfdi.de/entity/Q3025202 | 2005-07-13 | Paper |
Heavy cycles in Hamiltonian weighted graphs | 2005-05-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q4659596 | 2005-03-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q4707553 | 2004-02-08 | Paper |