According to our database
1,
Shinya Fujita
authored at least 82 papers
between 2002 and 2023.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2023
Minimum Number of Edges Guaranteeing the Existence of a K<sub>1, t</sub>-Factor in a Graph.
Graphs Comb., April, 2023
2021
On Properly Ordered Coloring of Vertices in a Vertex-Weighted Graph.
Order, 2021
Stable structure on safe set problems in vertex-weighted graphs.
Eur. J. Comb., 2021
The optimal proper connection number of a graph with given independence number.
Discret. Optim., 2021
2020
Optimal proper connection of graphs.
Optim. Lett., 2020
Stable Structure on Safe Set Problems in Vertex-Weighted Graphs II -Recognition and Complexity-.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020
2019
On the weighted safe set problem on paths and cycles.
J. Comb. Optim., 2019
On sufficient conditions for rainbow cycles in edge-colored graphs.
Discret. Math., 2019
General upper bounds on independent k-rainbow domination.
Discret. Appl. Math., 2019
Decomposing edge-coloured graphs under colour degree constraints.
Comb. Probab. Comput., 2019
2018
Safe sets, network majority on weighted trees.
Networks, 2018
Color degree and monochromatic degree conditions for short properly colored cycles in edge-colored graphs.
J. Graph Theory, 2018
Safe sets in graphs: Graph classes and structural parameters.
,
,
,
,
,
,
,
,
,
,
,
,
J. Comb. Optim., 2018
Highly connected subgraphs of graphs with given independence number.
Eur. J. Comb., 2018
Bounding the distance among longest paths in a connected graph.
Discret. Math., 2018
Kernels by properly colored paths in arc-colored digraphs.
Discret. Math., 2018
Safe number and integrity of graphs.
Discret. Appl. Math., 2018
2017
Decomposing edge-colored graphs under color degree constraints.
Electron. Notes Discret. Math., 2017
Vertex-disjoint copies of K<sub>1, t</sub> in K<sub>1, r</sub>-free graphs.
Discret. Math., 2017
2016
Partitioning a Graph into Highly Connected Subgraphs.
J. Graph Theory, 2016
Non-separating subgraphs in highly connected graphs.
J. Comb. Theory, Ser. B, 2016
Highly Connected Subgraphs of Graphs with Given Independence Number (Extended Abstract).
Electron. Notes Discret. Math., 2016
Network Majority on Tree Topological Network.
Electron. Notes Discret. Math., 2016
Safe set problem on graphs.
Discret. Appl. Math., 2016
Safe Sets in Graphs: Graph Classes and Structural Parameters.
,
,
,
,
,
,
,
,
,
,
,
Proceedings of the Combinatorial Optimization and Applications, 2016
2015
Downhill domination problem in graphs.
Inf. Process. Lett., 2015
General Bounds on Rainbow Domination Numbers.
Graphs Comb., 2015
Pebble exchange on graphs.
Discret. Appl. Math., 2015
From Edge-Coloring to Strong Edge-Coloring.
Electron. J. Comb., 2015
2014
A connected subgraph maintaining high connectivity.
Eur. J. Comb., 2014
Rainbow domination numbers on graphs with given radius.
Discret. Appl. Math., 2014
A Note on Covering Edge Colored Hypergraphs by Monochromatic Components.
Electron. J. Comb., 2014
Minimum degree conditions for vertex-disjoint even cycles in large graphs.
Adv. Appl. Math., 2014
2013
Forbidden Rainbow Subgraphs That Force Large Highly Connected Monochromatic Subgraphs.
SIAM J. Discret. Math., 2013
Disconnected Colors in Generalized Gallai-Colorings.
J. Graph Theory, 2013
Revisit of Erdős-Gallai's theorem on the circumference of a graph.
Inf. Process. Lett., 2013
The balanced decomposition number of <i>TK<sub>4</sub></i> and series -parallel graphs.
Discuss. Math. Graph Theory, 2013
Covering vertices by a specified number of disjoint cycles, edges and isolated vertices.
Discret. Math., 2013
Difference between 2-rainbow domination and Roman domination in graphs.
Discret. Appl. Math., 2013
Forbidden Subgraphs Generating Almost the Same Sets.
Comb. Probab. Comput., 2013
2012
Extensions of Gallai-Ramsey results.
J. Graph Theory, 2012
Colored pebble motion on graphs.
Eur. J. Comb., 2012
Proper connection of graphs.
Discret. Math., 2012
Minimally contraction-critically 6-connected graphs.
Discret. Math., 2012
k-Rainbow domatic numbers.
Discret. Appl. Math., 2012
Constructing connected bicritical graphs with edge-connectivity 2.
Discret. Appl. Math., 2012
Partition of Graphs and Hypergraphs into Monochromatic Connected Parts.
Electron. J. Comb., 2012
Generalized Ramsey Numbers for Graphs with Three Disjoint Cycles Versus a Complete Graph.
Electron. J. Comb., 2012
2011
Rainbow k-connection in Dense Graphs (Extended Abstract).
Electron. Notes Discret. Math., 2011
High connectivity keeping connected subgraph.
Electron. Notes Discret. Math., 2011
Gallai-Ramsey numbers for cycles.
Discret. Math., 2011
Some remarks on long monochromatic cycles in edge-colored complete graphs.
Discret. Math., 2011
Properly colored paths and cycles.
Discret. Appl. Math., 2011
Independence Number and Disjoint Theta Graphs.
Electron. J. Comb., 2011
Note on Highly Connected Monochromatic Subgraphs in 2-Colored Complete Graphs.
Electron. J. Comb., 2011
Long Path Lemma concerning Connectivity and Independence Number.
Electron. J. Comb., 2011
A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity.
Comb., 2011
2010
The Balanced Decomposition Number and Vertex Connectivity.
SIAM J. Discret. Math., 2010
Rainbow Generalizations of Ramsey Theory: A Survey.
Graphs Comb., 2010
Contractible Small Subgraphs in <i>k</i>-connected Graphs.
Graphs Comb., 2010
On a Sharp Degree Sum Condition for Disjoint Chorded Cycles in Graphs.
Graphs Comb., 2010
Non-separating even cycles in highly connected graphs.
Comb., 2010
2009
Colored Pebble Motion on Graphs (Extended Abstract).
Electron. Notes Discret. Math., 2009
Disjoint Even Cycles Packing.
Electron. Notes Discret. Math., 2009
Degree conditions for the partition of a graph into cycles, edges and isolated vertices.
Discret. Math., 2009
Note on non-separating and removable cycles in highly connected graphs.
Discret. Appl. Math., 2009
A Rainbow k-Matching in the Complete Graph with r Colors.
Electron. J. Comb., 2009
2008
Contractible elements in <i>k</i>-connected graphs not containing some specified graphs.
J. Graph Theory, 2008
Connectivity keeping edges in graphs with large minimum degree.
J. Comb. Theory, Ser. B, 2008
Vertex-disjoint copies of K<sub>1</sub>+(K<sub>1</sub> v K<sub>2</sub>) in claw-free graphs.
Discret. Math., 2008
K<sub>1, 3</sub>-factors in graphs.
Discret. Math., 2008
Balanced decomposition of a vertex-colored graph.
Discret. Appl. Math., 2008
2007
Edge-dominating cycles in graphs.
Discret. Math., 2007
2006
A pair of forbidden subgraphs and perfect matchings.
J. Comb. Theory, Ser. B, 2006
Degree sum conditions and vertex-disjoint cycles in a graph.
Australas. J Comb., 2006
2005
Recent Results on Disjoint Cycles in Graphs.
Electron. Notes Discret. Math., 2005
On graphs G for which both G and <i>'G</i> are claw-free.
Discuss. Math. Graph Theory, 2005
Existence of two disjoint long cycles in graphs.
Discret. Math., 2005
Partition of a graph into cycles and isolated vertices.
Australas. J Comb., 2005
Vertex-disjoint copies of K<sub>4</sub><sup>-</sup> in graphs.
Australas. J Comb., 2005
2002
Vertex-Disjoint K1, t's in Graphs.
Ars Comb., 2002
