Shinya Fujita

From MaRDI portal
Person:323045

Available identifiers

zbMath Open fujita.shinyaMaRDI QIDQ323045

List of research outcomes





PublicationDate of PublicationType
Monochromatic \(k\)-connection of graphs2024-12-04Paper
Safe sets and in-dominating sets in digraphs2024-02-14Paper
Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph2023-03-09Paper
Stable structure on safe set problems in vertex-weighted graphs. II: Recognition and complexity2022-12-21Paper
New classification of graphs in view of the domination number of central graphs2022-04-20Paper
On properly ordered coloring of vertices in a vertex-weighted graph2021-11-19Paper
The optimal proper connection number of a graph with given independence number2021-10-19Paper
Stable structure on safe set problems in vertex-weighted graphs2021-02-08Paper
Optimal proper connection of graphs2020-08-24Paper
Decomposing edge-colored graphs under color degree constraints2020-04-06Paper
Safe sets in digraphs2019-08-19Paper
Safe sets, network majority on weighted trees2019-08-12Paper
On sufficient conditions for rainbow cycles in edge-colored graphs2019-06-18Paper
On the weighted safe set problem on paths and cycles2019-06-06Paper
General upper bounds on independent \(k\)-rainbow domination2019-03-22Paper
International Competition and Distributive Class Conflict in an Open Economy <scp>K</scp>aleckian Model2019-02-07Paper
A new approach towards a conjecture on intersecting three longest paths2019-01-28Paper
Safe sets in graphs: graph classes and structural parameters2018-12-06Paper
Safe number and integrity of graphs2018-09-06Paper
Color degree and monochromatic degree conditions for short properly colored cycles in edge‐colored graphs2018-04-27Paper
Kernels by properly colored paths in arc-colored digraphs2018-04-19Paper
Bounding the distance among longest paths in a connected graph2018-02-23Paper
Decomposing edge-colored graphs under color degree constraints2018-01-18Paper
Network majority on tree topological network2017-02-13Paper
Vertex-disjoint copies of \(K_{1, t}\) in \(K_{1, r}\)-free graphs2017-02-06Paper
Safe Sets in Graphs: Graph Classes and Structural Parameters2017-02-01Paper
Safe set problem on graphs2016-10-07Paper
Partitioning a Graph into Highly Connected Subgraphs2016-08-12Paper
Non-separating subgraphs in highly connected graphs2016-01-28Paper
https://portal.mardi4nfdi.de/entity/Q55003142015-08-05Paper
General bounds on rainbow domination numbers2015-05-22Paper
Downhill domination problem in graphs2015-05-21Paper
Pebble exchange on graphs2015-04-28Paper
From edge-coloring to strong edge-coloring2015-04-22Paper
A note on covering edge colored hypergraphs by monochromatic components2014-09-04Paper
A connected subgraph maintaining high connectivity2014-07-29Paper
Revisit of Erdős-Gallai's theorem on the circumference of a graph2014-04-11Paper
On diameter and inverse degree of chemical graphs2014-03-26Paper
Minimum degree conditions for vertex-disjoint even cycles in large graphs2014-03-25Paper
Forbidden Subgraphs Generating Almost the Same Sets2014-02-24Paper
Rainbow domination numbers on graphs with given radius2014-02-18Paper
Forbidden rainbow subgraphs that force large highly connected monochromatic subgraphs2014-01-21Paper
The importance of the retention ratio in a Kaleckian model with debt accumulation2013-12-03Paper
The balanced decomposition number of \({TK}_4\) and series-parallel graphs2013-11-11Paper
Rainbow \(k\)-connection in dense graphs (extended abstract)2013-11-01Paper
High connectivity keeping connected subgraph2013-11-01Paper
Disjoint even cycles packing2013-10-10Paper
Colored pebble motion on graphs (extended abstract)2013-10-10Paper
Disconnected colors in generalized Gallai-colorings2013-10-09Paper
Proper connection with many colors2013-06-25Paper
Difference between 2-rainbow domination and roman domination in graphs2013-04-18Paper
Covering vertices by a specified number of disjoint cycles, edges and isolated vertices2013-01-03Paper
Around a biclique cover conjecture2012-12-31Paper
Partition of graphs and hypergraphs into monochromatic connected parts2012-10-24Paper
Extensions of Gallai-Ramsey results2012-08-31Paper
Proper connection of graphs2012-08-10Paper
Generalized Ramsey numbers for graphs with three disjoint cycles versus a complete graph2012-06-12Paper
\(k\)-rainbow domatic numbers2012-05-30Paper
Colored pebble motion on graphs2012-05-04Paper
Constructing connected bicritical graphs with edge-connectivity 22012-05-04Paper
A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity2012-04-26Paper
Contractible triples in highly connected graphs2012-01-24Paper
Minimally contraction-critically 6-connected graphs2012-01-11Paper
Non-separating even cycles in highly connected graphs2011-12-19Paper
Properly colored paths and cycles2011-10-27Paper
Long path lemma concerning connectivity and independence number2011-07-29Paper
Independence number and disjoint theta graphs2011-07-29Paper
Gallai-Ramsey numbers for cycles2011-05-31Paper
Some remarks on long monochromatic cycles in edge-colored complete graphs2011-05-06Paper
Note on highly connected monochromatic subgraphs in 2-colored complete graphs2011-02-17Paper
Rainbow generalizations of Ramsey theory: A survey2010-11-12Paper
On a sharp degree sum condition for disjoint chorded cycles in graphs2010-11-12Paper
Contractible small subgraphs in \(k\)-connected graphs2010-11-12Paper
A rainbow \(k\)-matching in the complete graph with \(r\) colors2009-07-08Paper
Degree conditions for the partition of a graph into cycles, edges and isolated vertices2009-06-19Paper
On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs2009-04-21Paper
Balanced decomposition of a vertex-colored graph2009-03-04Paper
Note on non-separating and removable cycles in highly connected graphs2009-03-04Paper
\(K_{1,3}\)-factors in graphs2009-01-28Paper
https://portal.mardi4nfdi.de/entity/Q35304612008-10-20Paper
Connectivity keeping edges in graphs with large minimum degree2008-07-24Paper
Contractible elements ink-connected graphs not containing some specified graphs2008-06-12Paper
Vertex-disjoint copies of \(K_{1}+(K_{1} \cup K_{2}\)) in claw-free graphs2008-03-13Paper
Edge-dominating cycles in graphs2007-11-30Paper
Disjoint stars and forbidden subgraphs2007-08-20Paper
Recent Results on Disjoint Cycles in Graphs2007-05-29Paper
On graphs G for which both G and G are claw-free2006-10-16Paper
https://portal.mardi4nfdi.de/entity/Q54807182006-08-03Paper
A pair of forbidden subgraphs and perfect matchings.2006-05-18Paper
Existence of two disjoint long cycles in graphs2006-01-10Paper
https://portal.mardi4nfdi.de/entity/Q53144092005-09-05Paper
https://portal.mardi4nfdi.de/entity/Q54615522005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q30252022005-07-13Paper
Heavy cycles in Hamiltonian weighted graphs2005-05-03Paper
https://portal.mardi4nfdi.de/entity/Q46595962005-03-21Paper
https://portal.mardi4nfdi.de/entity/Q47075532004-02-08Paper
Monochromatic $k$-connection of graphsN/APaper

Research outcomes over time

This page was built for person: Shinya Fujita