Shinya Fujita

Yoshimi Egawa

Graphs Comb., April, 2023

2021

On Properly Ordered Coloring of Vertices in a Vertex-Weighted Graph.

[BibT_eX]

[DOI]

Order, 2021

Stable structure on safe set problems in vertex-weighted graphs.

[BibT_eX]

[DOI]

Boram Park

Eur. J. Comb., 2021

The optimal proper connection number of a graph with given independence number.

[BibT_eX]

[DOI]

Boram Park

Discret. Optim., 2021

2020

Optimal proper connection of graphs.

[BibT_eX]

[DOI]

Optim. Lett., 2020

Stable Structure on Safe Set Problems in Vertex-Weighted Graphs II -Recognition and Complexity-.

[BibT_eX]

[DOI]

Boram Park

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

2019

On the weighted safe set problem on paths and cycles.

[BibT_eX]

[DOI]

J. Comb. Optim., 2019

On sufficient conditions for rainbow cycles in edge-colored graphs.

[BibT_eX]

[DOI]

Discret. Math., 2019

General upper bounds on independent k-rainbow domination.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Decomposing edge-coloured graphs under colour degree constraints.

[BibT_eX]

[DOI]

Ruonan Li

Guanghui Wang

Comb. Probab. Comput., 2019

Safe sets in digraphs.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Safe sets, network majority on weighted trees.

[BibT_eX]

[DOI]

Networks, 2018

Color degree and monochromatic degree conditions for short properly colored cycles in edge-colored graphs.

[BibT_eX]

[DOI]

Ruonan Li

Shenggui Zhang

J. Graph Theory, 2018

Safe sets in graphs: Graph classes and structural parameters.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

Highly connected subgraphs of graphs with given independence number.

[BibT_eX]

[DOI]

Amites Sarkar

Eur. J. Comb., 2018

Bounding the distance among longest paths in a connected graph.

[BibT_eX]

[DOI]

Discret. Math., 2018

Kernels by properly colored paths in arc-colored digraphs.

[BibT_eX]

[DOI]

Yandong Bai

Shenggui Zhang

Discret. Math., 2018

Safe number and integrity of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

2017

Decomposing edge-colored graphs under color degree constraints.

[BibT_eX]

[DOI]

Ruonan Li

Guanghui Wang

Electron. Notes Discret. Math., 2017

Vertex-disjoint copies of K1, t in K1, r-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2017

2016

Partitioning a Graph into Highly Connected Subgraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2016

Non-separating subgraphs in highly connected graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

Highly Connected Subgraphs of Graphs with Given Independence Number (Extended Abstract).

[BibT_eX]

[DOI]

Amites Sarkar

Electron. Notes Discret. Math., 2016

Network Majority on Tree Topological Network.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

Safe set problem on graphs.

[BibT_eX]

[DOI]

Gary MacGillivray

Discret. Appl. Math., 2016

Safe Sets in Graphs: Graph Classes and Structural Parameters.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2016

2015

Downhill domination problem in graphs.

[BibT_eX]

[DOI]

Xue-Gang Chen

Inf. Process. Lett., 2015

General Bounds on Rainbow Domination Numbers.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Pebble exchange on graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

From Edge-Coloring to Strong Edge-Coloring.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

2014

A connected subgraph maintaining high connectivity.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

Rainbow domination numbers on graphs with given radius.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

A Note on Covering Edge Colored Hypergraphs by Monochromatic Components.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

Minimum degree conditions for vertex-disjoint even cycles in large graphs.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2014

2013

Forbidden Rainbow Subgraphs That Force Large Highly Connected Monochromatic Subgraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Disconnected Colors in Generalized Gallai-Colorings.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

Revisit of Erdős-Gallai's theorem on the circumference of a graph.

[BibT_eX]

[DOI]

Linda M. Lesniak

Inf. Process. Lett., 2013

The balanced decomposition number of TK4 and series -parallel graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2013

Covering vertices by a specified number of disjoint cycles, edges and isolated vertices.

[BibT_eX]

[DOI]

Discret. Math., 2013

Difference between 2-rainbow domination and Roman domination in graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Forbidden Subgraphs Generating Almost the Same Sets.

[BibT_eX]

[DOI]

Kenta Ozeki

Comb. Probab. Comput., 2013

2012

Extensions of Gallai-Ramsey results.

[BibT_eX]

[DOI]

J. Graph Theory, 2012

Colored pebble motion on graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

Proper connection of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

Minimally contraction-critically 6-connected graphs.

[BibT_eX]

[DOI]

Kiyoshi Ando

Discret. Math., 2012

k-Rainbow domatic numbers.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Constructing connected bicritical graphs with edge-connectivity 2.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Partition of Graphs and Hypergraphs into Monochromatic Connected Parts.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

Generalized Ramsey Numbers for Graphs with Three Disjoint Cycles Versus a Complete Graph.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

2011

Rainbow k-connection in Dense Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

High connectivity keeping connected subgraph.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Gallai-Ramsey numbers for cycles.

[BibT_eX]

[DOI]

Discret. Math., 2011

Some remarks on long monochromatic cycles in edge-colored complete graphs.

[BibT_eX]

[DOI]

Discret. Math., 2011

Properly colored paths and cycles.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Independence Number and Disjoint Theta Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2011

Note on Highly Connected Monochromatic Subgraphs in 2-Colored Complete Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2011

Long Path Lemma concerning Connectivity and Independence Number.

[BibT_eX]

[DOI]

Alexander Halperin

Electron. J. Comb., 2011

A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity.

[BibT_eX]

[DOI]

Comb., 2011

2010

The Balanced Decomposition Number and Vertex Connectivity.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2010

Rainbow Generalizations of Ramsey Theory: A Survey.

[BibT_eX]

[DOI]

Kenta Ozeki

Graphs Comb., 2010

Contractible Small Subgraphs in k-connected Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2010

On a Sharp Degree Sum Condition for Disjoint Chorded Cycles in Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2010

Non-separating even cycles in highly connected graphs.

[BibT_eX]

[DOI]

Comb., 2010

2009

Colored Pebble Motion on Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Disjoint Even Cycles Packing.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Degree conditions for the partition of a graph into cycles, edges and isolated vertices.

[BibT_eX]

[DOI]

Discret. Math., 2009

Note on non-separating and removable cycles in highly connected graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

A Rainbow k-Matching in the Complete Graph with r Colors.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

2008

Contractible elements in k-connected graphs not containing some specified graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2008

Connectivity keeping edges in graphs with large minimum degree.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2008

Vertex-disjoint copies of K1+(K1 v K2) in claw-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

K1, 3-factors in graphs.

[BibT_eX]

[DOI]

Yoshimi Egawa

Katsuhiro Ota

Discret. Math., 2008

Balanced decomposition of a vertex-colored graph.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

2007

Edge-dominating cycles in graphs.

[BibT_eX]

[DOI]

Akira Saito

Tomoki Yamashita

Discret. Math., 2007

2006

A pair of forbidden subgraphs and perfect matchings.

[BibT_eX]

[DOI]

Cláudio Leonardo Lucchesi

Katsuhiro Ota

Michael D. Plummer

Akira Saito

J. Comb. Theory B, 2006

Degree sum conditions and vertex-disjoint cycles in a graph.

[BibT_eX]

[DOI]

Australas. J Comb., 2006

2005

Recent Results on Disjoint Cycles in Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

On graphs G for which both G and 'G are claw-free.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2005

Existence of two disjoint long cycles in graphs.

[BibT_eX]

[DOI]

Yoshimi Egawa

Hong Wang

Discret. Math., 2005

Partition of a graph into cycles and isolated vertices.

[BibT_eX]

[DOI]

Australas. J Comb., 2005

Vertex-disjoint copies of K4- in graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2005

2002

Vertex-Disjoint K1, t's in Graphs.

[BibT_eX]