Yoshimi Egawa

According to our database, Yoshimi Egawa authored at least 85 papers between 1981 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2023

Properly 3-contractible edges in a minimally 3-connected graph.

Kiyoshi Ando, Yoshimi Egawa

Discret. Math., May, 2023

Minimum Number of Edges Guaranteeing the Existence of a K_{1, t}-Factor in a Graph.

Shuya Chiba, Yoshimi Egawa, Shinya Fujita

Graphs Comb., April, 2023

Contractible Edges and Longest Cycles in 3-Connected Graphs.

Yoshimi Egawa, Shunsuke Nakamura

Graphs Comb., February, 2023

2022

Factors of bi-regular bipartite graphs.

Yoshimi Egawa, Michitaka Furuya, Mikio Kano

Discret. Appl. Math., 2022

Forbidden triples generating a finite set of graphs with minimum degree three.

Yoshimi Egawa, Michitaka Furuya

Discret. Appl. Math., 2022

2021

Contractible Edges and Contractible Triangles in a 3-Connected Graph.

Kiyoshi Ando, Yoshimi Egawa

Graphs Comb., 2021

Existence of a spanning tree having small diameter.

Yoshimi Egawa, Michitaka Furuya, Hajime Matsumura

Discret. Math., 2021

2020

Existence of all generalized fractional (g, f)-factors of graphs.

Yoshimi Egawa, Mikio Kano, Maho Yokota

Discret. Appl. Math., 2020

Tree in forbidden triples generating a finite set of graphs with high connectivity.

Yoshimi Egawa, Zhixian Zhao

AKCE Int. J. Graphs Comb., 2020

2018

Sufficient conditions for the existence of a path-factor which are related to odd components.

Yoshimi Egawa, Michitaka Furuya, Kenta Ozeki

J. Graph Theory, 2018

Lower Bound on the Number of Contractible Edges in a 4-Connected Graph with Edges Not Contained in Triangles.

Yoshimi Egawa, Keiko Kotani, Shunsuke Nakamura

Graphs Comb., 2018

Edges incident with a vertex of degree greater than four and a lower bound on the number of contractible edges in a 4-connected graph.

Shunsuke Nakamura, Yoshimi Egawa, Keiko Kotani

Electron. Notes Discret. Math., 2018

Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles.

Yoshimi Egawa, Michitaka Furuya

Discret. Math., 2018

The graph grabbing game on Km, n-trees.

Yoshimi Egawa, Hikoe Enomoto, Naoki Matsumoto

Discret. Math., 2018

The Existence of a Path-Factor without Small Odd Paths.

Yoshimi Egawa, Michitaka Furuya

Electron. J. Comb., 2018

Structure of edges in a 4-connected graph not contained in triangles and the number of contractible edges.

Yoshimi Egawa, Keiko Kotani, Shunsuke Nakamura

AKCE Int. J. Graphs Comb., 2018

2016

Perfect Matchings Avoiding Several Independent Edges in a Star-Free Graph.

Yoshimi Egawa, Michitaka Furuya

J. Graph Theory, 2016

(1, f)-Factors of Graphs with Odd Property.

Yoshimi Egawa, Mikio Kano, Zheng Yan

Graphs Comb., 2016

2015

Spanning Trees with Vertices Having Large Degrees.

Yoshimi Egawa, Kenta Ozeki

J. Graph Theory, 2015

Perfect matchings avoiding prescribed edges in a star-free graph.

Yoshimi Egawa, Jun Fujisawa, Michael D. Plummer, Akira Saito, Tomoki Yamashita

Discret. Math., 2015

Forbidden Triples Generating a Finite set of 3-Connected Graphs.

Yoshimi Egawa, Jun Fujisawa, Michitaka Furuya, Michael D. Plummer, Akira Saito

Electron. J. Comb., 2015

2014

The Average Degree of Minimally Contraction-Critically 5-Connected Graphs.

Kiyoshi Ando, Yoshimi Egawa, Matthias Kriesell

J. Graph Theory, 2014

Forbidden Triples Containing a Complete Graph and a Complete Bipartite Graph of Small Order.

Yoshimi Egawa, Michitaka Furuya

Graphs Comb., 2014

Star-cycle factors of graphs.

Yoshimi Egawa, Mikio Kano, Zheng Yan

Discuss. Math. Graph Theory, 2014

A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees.

Yoshimi Egawa, Kenta Ozeki

Comb., 2014

2013

Upper Bounds on the Paired Domination Subdivision Number of a Graph.

Yoshimi Egawa, Michitaka Furuya, Masanori Takatou

Graphs Comb., 2013

Existence of 4-factors in star-free graphs with high connectivity.

Yoshimi Egawa, Keiko Kotani

Australas. J Comb., 2013

2012

Forbidden pairs for 1-s2.0-S0012365X11004766-si1-connected Hamiltonian graphs.

Guantao Chen, Yoshimi Egawa, Ronald J. Gould, Akira Saito

Discret. Math., 2012

2011

The existence of a 2-factor in <i>K</i>_{1, <i>n</i>}-free graphs with large connectivity and large edge-connectivity.

Robert E. L. Aldred, Yoshimi Egawa, Jun Fujisawa, Katsuhiro Ota, Akira Saito

J. Graph Theory, 2011

Toughness of <i>K_a,t</i>-Minor-Free Graphs.

Guantao Chen, Yoshimi Egawa, Ken-ichi Kawarabayashi, Bojan Mohar, Katsuhiro Ota

Electron. J. Comb., 2011

2010

A 2-factor in which each cycle contains a vertex in a specified stable set.

Shuya Chiba, Yoshimi Egawa, Kiyoshi Yoshimoto

Australas. J Comb., 2010

2009

On the number of 4-contractible edges in 4-connected graphs.

Kiyoshi Ando, Yoshimi Egawa, Ken-ichi Kawarabayashi, Matthias Kriesell

J. Comb. Theory, Ser. B, 2009

5-Shredders in 5-connected graphs.

Yoshimi Egawa, Yumiko Okadome, Masanori Takatou

Discret. Math., 2009

4-factors in 2-connected star-free graphs.

Yoshimi Egawa, Keiko Kotani

Discret. Math., 2009

Arbitrary decompositions into open and closed trails.

Sylwia Cichacz, Yoshimi Egawa, Mariusz Wozniak

Discret. Math., 2009

2008

<i>k</i>-shredders in <i>k</i>-connected graphs.

Yoshimi Egawa

J. Graph Theory, 2008

On a Spanning Tree with Specified Leaves.

Yoshimi Egawa, Haruhide Matsuda, Tomoki Yamashita, Kiyoshi Yoshimoto

Graphs Comb., 2008

K_{1, 3}-factors in graphs.

Yoshimi Egawa, Shinya Fujita, Katsuhiro Ota

Discret. Math., 2008

Edges not contained in triangles and the number of contractible edges in a 4-connected graph.

Kiyoshi Ando, Yoshimi Egawa

Discret. Math., 2008

Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph.

Kiyoshi Ando, Yoshimi Egawa

Discret. Math., 2008

2007

Contractible Edges in a 4-Connected Graph with Vertices of Degree Greater Than Four.

Kiyoshi Ando, Yoshimi Egawa

Graphs Comb., 2007

Independence number and vertex-disjoint cycles.

Yoshimi Egawa, Hikoe Enomoto, Stanislav Jendrol', Katsuhiro Ota, Ingo Schiermeyer

Discret. Math., 2007

2005

Existence of two disjoint long cycles in graphs.

Yoshimi Egawa, Shinya Fujita, Ken-ichi Kawarabayashi, Hong Wang

Discret. Math., 2005

A bound on the order of a graph when both the graph and its complement are contraction-critically k-connected.

Yoshimi Egawa, Masao Tsugaki

Australas. J Comb., 2005

2003

Two-factors each component of which contains a specified vertex.

Yoshimi Egawa, Hikoe Enomoto, Ralph J. Faudree, Hao Li, Ingo Schiermeyer

J. Graph Theory, 2003

Covering vertices of a graph by k disjoint cycles.

Yoshimi Egawa, Mariko Hagita, Ken-ichi Kawarabayashi, Hong Wang

Discret. Math., 2003

Maximum number of edges in a critically <i>k</i>-connected graph.

Kiyoshi Ando, Yoshimi Egawa

Discret. Math., 2003

2002

Fan-type theorem for path-connectivity.

Zhiquan Hu, Feng Tian, Bing Wei, Yoshimi Egawa, Kazuhide Hirohata

J. Graph Theory, 2002

Graphs G for which both G and G^- are Contraction Critically k-Connected.

Jin Akiyama, Kiyoshi Ando, Yoshimi Egawa

Graphs Comb., 2002

Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs.

Yoshimi Egawa, Katsumi Inoue, Ken-ichi Kawarabayashi

Electron. Notes Discret. Math., 2002

Path factors in claw-free graphs.

Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda

Discret. Math., 2002

Graph decompositions through prescribed vertices without isolates.

Yoshimi Egawa, Hikoe Enomoto, Norihide Tokushige

Ars Comb., 2002

2001

Vertex-Disjoint Paths in Graphs.

Yoshimi Egawa, Katsuhiro Ota

Ars Comb., 2001

2000

Vertex-Disjoint Cycles Containing Specified Edges.

Yoshimi Egawa, Ralph J. Faudree, Ervin Györi, Yoshiyasu Ishigami, Richard H. Schelp, Hong Wang

Graphs Comb., 2000

1999

Vertex-disjoint claws in graphs.

Yoshimi Egawa, Katsuhiro Ota

Discret. Math., 1999

Graph Labelings in Boolean Lattices.

Yoshimi Egawa, Masahiko Miyamoto

Ars Comb., 1999

Radius of (2k-1)-Connected Graphs.

Yoshimi Egawa, Katsumi Inoue

Ars Comb., 1999

1998

Contractible Cycles in Graphs with Girth at Least 5.

Yoshimi Egawa

J. Comb. Theory, Ser. B, 1998

1997

Star partitions of graphs.

Yoshimi Egawa, Mikio Kano, Alexander K. Kelmans

J. Graph Theory, 1997

Contractible cycles in graphs with large minimum degree.

Yoshimi Egawa

Discret. Math., 1997

The minimum number of edges in a vertex diameter-2-critical graph.

Kiyoshi Ando, Yoshimi Egawa

Discret. Math., 1997

1996

Essential independent sets and Hamiltonian cycles.

Guantao Chen, Yoshimi Egawa, Xin Liu, Akira Saito

J. Graph Theory, 1996

Vertex-Disjoint Cycles of the Same Length.

Yoshimi Egawa

J. Comb. Theory, Ser. B, 1996

Sufficient conditions for graphs to have (g, f)-factors.

Yoshimi Egawa, Mikio Kano

Discret. Math., 1996

1995

The maximal number of induced<i>r</i>-partite subgraphs.

Béla Bollobás, Yoshimi Egawa, Andrew J. Harris, Guoping Jin

Graphs Comb., 1995

Non-Contractible Edges in A 3-Connected Graph.

Yoshimi Egawa, Katsuhiro Ota, Akira Saito, Xingxing Yu

Comb., 1995

1992

Spanning trees in a cactus.

Yoshimi Egawa, Preben D. Vestergaard

Discret. Math., 1992

1991

Regular factors in <i>K</i>_{1, <i>n</i>} free graphs.

Yoshimi Egawa, Katsuhiro Ota

J. Graph Theory, 1991

Cycles and paths through specified vertices in <i>k</i>-connected graphs.

Yoshimi Egawa, R. Glas, Stephen C. Locke

J. Comb. Theory, Ser. B, 1991

Contractible edges in<i>n</i>-connected graphs with minimum degree greater than or equal to [5<i>n</i>/4].

Yoshimi Egawa

Graphs Comb., 1991

Contractible edges in non-separating cycles.

Yoshimi Egawa, Akira Saito

Comb., 1991

A mixed version of Menger's theorem.

Yoshimi Egawa, Atsushi Kaneko, Makoto Matsumoto

Comb., 1991

1989

The longest cycles in a graph <i>G</i> with minimum degree at least |<i>G</i>|/<i>k</i>.

Yoshimi Egawa, Takashi Miyamoto

J. Comb. Theory, Ser. B, 1989

1988

Factors and induced subgraphs.

Yoshimi Egawa, Hikoe Enomoto, Akira Saito

Discret. Math., 1988

Preface.

Jin Akiyama, Yoshimi Egawa, Hikoe Enomoto

Discret. Math., 1988

1987

Cycles in <i>k</i>-connected graphs whose deletion results in a (<i>k</i>-2)-connected graph.

Yoshimi Egawa

J. Comb. Theory, Ser. B, 1987

On randomly<i>n</i>-cyclic digraphs.

Yoshimi Egawa, Takashi Miyamoto, Sergio Ruiz

Graphs Comb., 1987

Graphs G for which G and _G are both semidecomposable.

Kiyoshi Ando, Yoshimi Egawa, Hirobumi Mizuno

Discret. Math., 1987

1986

On component factors.

Yoshimi Egawa, Hikoe Enomoto, Akira Saito

Graphs Comb., 1986

A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components.

Yoshimi Egawa, Masatsugu Urabe, Toshihito Fukuda, Seiichiro Nagoya

Discret. Math., 1986

Characterization of the cartesian product of complete graphs by convex subgraphs.

Yoshimi Egawa

Discret. Math., 1986

Contracible edges in triangle-free graphs.

Yoshimi Egawa, Hikoe Enomoto, Akira Saito

Comb., 1986

1985

Association Schemes of Quadratic Forms.

Yoshimi Egawa

J. Comb. Theory, Ser. A, 1985

Even edge colorings of a graph.

Noga Alon, Yoshimi Egawa

J. Comb. Theory, Ser. B, 1985

1981

Characterization of H(n, q) by the Parameters.

Yoshimi Egawa

J. Comb. Theory, Ser. A, 1981