Yoshimi Egawa

Publication Activity (10 Years)

Years Active: 1981-2024
Publications (10 Years): 21

Top Topics

Sufficient Conditions

Connected Graphs

Top Venues

Discret. Appl. Math.

J. Graph Theory

Publications

Yoshimi Egawa, Shunsuke Nakamura
Edges incident with a vertex of degree greater than four and the number of contractible edges in a 4-connected graph. Discret. Appl. Math. 355 (2024)
Yoshimi Egawa, Keiko Kotani, Jumpei Yamamoto
Existence of 4-factors in star-free graphs with edge-connectivity conditions. AKCE Int. J. Graphs Comb. 21 (1) (2024)
Masayoshi Doki, Yoshimi Egawa, Naoki Matsumoto
Graph grabbing game on graphs with forbidden subgraphs. Discuss. Math. Graph Theory 44 (1) (2024)
Shuya Chiba, Yoshimi Egawa, Shinya Fujita
-Factor in a Graph. Graphs Comb. 39 (2) (2023)
Kiyoshi Ando, Yoshimi Egawa
Properly 3-contractible edges in a minimally 3-connected graph. Discret. Math. 346 (5) (2023)
Yoshimi Egawa, Shunsuke Nakamura
Contractible Edges and Longest Cycles in 3-Connected Graphs. Graphs Comb. 39 (1) (2023)
Yoshimi Egawa, Michitaka Furuya, Mikio Kano
Factors of bi-regular bipartite graphs. Discret. Appl. Math. 322 (2022)
Yoshimi Egawa, Michitaka Furuya
Forbidden triples generating a finite set of graphs with minimum degree three. Discret. Appl. Math. 320 (2022)
Kiyoshi Ando, Yoshimi Egawa
Contractible Edges and Contractible Triangles in a 3-Connected Graph. Graphs Comb. 37 (5) (2021)
Yoshimi Egawa, Michitaka Furuya, Hajime Matsumura
Existence of a spanning tree having small diameter. Discret. Math. 344 (11) (2021)
Yoshimi Egawa, Zhixian Zhao
Tree in forbidden triples generating a finite set of graphs with high connectivity. AKCE Int. J. Graphs Comb. 17 (1) (2020)
Yoshimi Egawa, Mikio Kano, Maho Yokota
Existence of all generalized fractional (g, f)-factors of graphs. Discret. Appl. Math. 283 (2020)
Yoshimi Egawa, Hikoe Enomoto, Naoki Matsumoto
The graph grabbing game on Km, n-trees. Discret. Math. 341 (6) (2018)
Yoshimi Egawa, Michitaka Furuya, Kenta Ozeki
Sufficient conditions for the existence of a path-factor which are related to odd components. J. Graph Theory 89 (3) (2018)
Yoshimi Egawa, Michitaka Furuya
The Existence of a Path-Factor without Small Odd Paths. Electron. J. Comb. 25 (1) (2018)
Shunsuke Nakamura, Yoshimi Egawa, Keiko Kotani
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. Electron. Notes Discret. Math. 68 (2018)
Yoshimi Egawa, Michitaka Furuya
Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles. Discret. Math. 341 (8) (2018)
Yoshimi Egawa, Keiko Kotani, Shunsuke Nakamura
Lower Bound on the Number of Contractible Edges in a 4-Connected Graph with Edges Not Contained in Triangles. Graphs Comb. 34 (5) (2018)
Yoshimi Egawa, Keiko Kotani, Shunsuke Nakamura
Structure of edges in a 4-connected graph not contained in triangles and the number of contractible edges. AKCE Int. J. Graphs Comb. 15 (2) (2018)
Yoshimi Egawa, Mikio Kano, Zheng Yan
(1, f)-Factors of Graphs with Odd Property. Graphs Comb. 32 (1) (2016)
Yoshimi Egawa, Michitaka Furuya
Perfect Matchings Avoiding Several Independent Edges in a Star-Free Graph. J. Graph Theory 82 (1) (2016)
Yoshimi Egawa, Jun Fujisawa, Michitaka Furuya, Michael D. Plummer, Akira Saito
Forbidden Triples Generating a Finite set of 3-Connected Graphs. Electron. J. Comb. 22 (3) (2015)
Yoshimi Egawa, Jun Fujisawa, Michael D. Plummer, Akira Saito, Tomoki Yamashita
Perfect matchings avoiding prescribed edges in a star-free graph. Discret. Math. 338 (12) (2015)
Yoshimi Egawa, Kenta Ozeki
Spanning Trees with Vertices Having Large Degrees. J. Graph Theory 79 (3) (2015)
Yoshimi Egawa, Kenta Ozeki
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees. Comb. 34 (1) (2014)
Yoshimi Egawa, Mikio Kano, Zheng Yan
Star-cycle factors of graphs. Discuss. Math. Graph Theory 34 (1) (2014)
Kiyoshi Ando, Yoshimi Egawa, Matthias Kriesell
The Average Degree of Minimally Contraction-Critically 5-Connected Graphs. J. Graph Theory 75 (4) (2014)
Yoshimi Egawa, Michitaka Furuya
Forbidden Triples Containing a Complete Graph and a Complete Bipartite Graph of Small Order. Graphs Comb. 30 (5) (2014)
Yoshimi Egawa, Keiko Kotani
Existence of 4-factors in star-free graphs with high connectivity. Australas. J Comb. 55 (2013)
Yoshimi Egawa, Michitaka Furuya, Masanori Takatou
Upper Bounds on the Paired Domination Subdivision Number of a Graph. Graphs Comb. 29 (4) (2013)
Guantao Chen, Yoshimi Egawa, Ronald J. Gould, Akira Saito
Forbidden pairs for 1-s2.0-S0012365X11004766-si1-connected Hamiltonian graphs. Discret. Math. 312 (5) (2012)
Guantao Chen, Yoshimi Egawa, Ken-ichi Kawarabayashi, Bojan Mohar, Katsuhiro Ota
-Minor-Free Graphs. Electron. J. Comb. 18 (1) (2011)
Robert E. L. Aldred, Yoshimi Egawa, Jun Fujisawa, Katsuhiro Ota, Akira Saito
-free graphs with large connectivity and large edge-connectivity. J. Graph Theory 68 (1) (2011)
Shuya Chiba, Yoshimi Egawa, Kiyoshi Yoshimoto
A 2-factor in which each cycle contains a vertex in a specified stable set. Australas. J Comb. 46 (2010)
Yoshimi Egawa, Yumiko Okadome, Masanori Takatou
5-Shredders in 5-connected graphs. Discret. Math. 309 (6) (2009)
Yoshimi Egawa, Keiko Kotani
4-factors in 2-connected star-free graphs. Discret. Math. 309 (21) (2009)
Kiyoshi Ando, Yoshimi Egawa, Ken-ichi Kawarabayashi, Matthias Kriesell
On the number of 4-contractible edges in 4-connected graphs. J. Comb. Theory, Ser. B 99 (1) (2009)
Sylwia Cichacz, Yoshimi Egawa, Mariusz Wozniak
Arbitrary decompositions into open and closed trails. Discret. Math. 309 (6) (2009)
Yoshimi Egawa, Shinya Fujita, Katsuhiro Ota
-factors in graphs. Discret. Math. 308 (24) (2008)
Kiyoshi Ando, Yoshimi Egawa
Edges not contained in triangles and the number of contractible edges in a 4-connected graph. Discret. Math. 308 (23) (2008)
Yoshimi Egawa, Haruhide Matsuda, Tomoki Yamashita, Kiyoshi Yoshimoto
On a Spanning Tree with Specified Leaves. Graphs Comb. 24 (1) (2008)
Yoshimi Egawa, Katsumi Inoue, Ken-ichi Kawarabayashi
Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs. SIAM J. Discret. Math. 21 (4) (2008)
Kiyoshi Ando, Yoshimi Egawa
Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph. Discret. Math. 308 (16) (2008)
Yoshimi Egawa
-connected graphs. J. Graph Theory 59 (3) (2008)
Kiyoshi Ando, Yoshimi Egawa
Contractible Edges in a 4-Connected Graph with Vertices of Degree Greater Than Four. Graphs Comb. 23 (Supplement-1) (2007)
Yoshimi Egawa, Hikoe Enomoto, Stanislav Jendrol', Katsuhiro Ota, Ingo Schiermeyer
Independence number and vertex-disjoint cycles. Discret. Math. 307 (11-12) (2007)
Yoshimi Egawa, Masao Tsugaki
A bound on the order of a graph when both the graph and its complement are contraction-critically k-connected. Australas. J Comb. 32 (2005)
Yoshimi Egawa, Shinya Fujita, Ken-ichi Kawarabayashi, Hong Wang
Existence of two disjoint long cycles in graphs. Discret. Math. 305 (1-3) (2005)
Yoshimi Egawa, Hikoe Enomoto, Ralph J. Faudree, Hao Li, Ingo Schiermeyer
Two-factors each component of which contains a specified vertex. J. Graph Theory 43 (3) (2003)
Yoshimi Egawa, Mariko Hagita, Ken-ichi Kawarabayashi, Hong Wang
Covering vertices of a graph by k disjoint cycles. Discret. Math. 270 (1-3) (2003)
Kiyoshi Ando, Yoshimi Egawa
-connected graph. Discret. Math. 260 (1-3) (2003)
Jin Akiyama, Kiyoshi Ando, Yoshimi Egawa
are Contraction Critically k-Connected. Graphs Comb. 18 (4) (2002)
Yoshimi Egawa, Hikoe Enomoto, Norihide Tokushige
Graph decompositions through prescribed vertices without isolates. Ars Comb. 62 (2002)
Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda
Path factors in claw-free graphs. Discret. Math. 243 (1-3) (2002)
Yoshimi Egawa, Katsumi Inoue, Ken-ichi Kawarabayashi
Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs. Electron. Notes Discret. Math. 11 (2002)
Zhiquan Hu, Feng Tian, Bing Wei, Yoshimi Egawa, Kazuhide Hirohata
Fan-type theorem for path-connectivity. J. Graph Theory 39 (4) (2002)
Yoshimi Egawa, Katsuhiro Ota
Vertex-Disjoint Paths in Graphs. Ars Comb. 61 (2001)
Yoshimi Egawa, Ralph J. Faudree, Ervin Györi, Yoshiyasu Ishigami, Richard H. Schelp, Hong Wang
Vertex-Disjoint Cycles Containing Specified Edges. Graphs Comb. 16 (1) (2000)
Yoshimi Egawa, Masahiko Miyamoto
Graph Labelings in Boolean Lattices. Ars Comb. 52 (1999)
Yoshimi Egawa, Katsumi Inoue
Radius of (2k-1)-Connected Graphs. Ars Comb. 51 (1999)
Yoshimi Egawa, Katsuhiro Ota
Vertex-disjoint claws in graphs. Discret. Math. (1999)
Yoshimi Egawa
Contractible Cycles in Graphs with Girth at Least 5. J. Comb. Theory, Ser. B 74 (2) (1998)
Kiyoshi Ando, Yoshimi Egawa
The minimum number of edges in a vertex diameter-2-critical graph. Discret. Math. (1997)
Yoshimi Egawa
Contractible cycles in graphs with large minimum degree. Discret. Math. 171 (1-3) (1997)
Yoshimi Egawa, Mikio Kano, Alexander K. Kelmans
Star partitions of graphs. J. Graph Theory 25 (3) (1997)
Guantao Chen, Yoshimi Egawa, Xin Liu, Akira Saito
Essential independent sets and Hamiltonian cycles. J. Graph Theory 21 (2) (1996)
Yoshimi Egawa, Mikio Kano
Sufficient conditions for graphs to have (g, f)-factors. Discret. Math. 151 (1-3) (1996)
Yoshimi Egawa
Vertex-Disjoint Cycles of the Same Length. J. Comb. Theory, Ser. B 66 (2) (1996)
Yoshimi Egawa, Katsuhiro Ota, Akira Saito, Xingxing Yu
Non-Contractible Edges in A 3-Connected Graph. Comb. 15 (3) (1995)
Béla Bollobás, Yoshimi Egawa, Andrew J. Harris, Guoping Jin
-partite subgraphs. Graphs Comb. 11 (1) (1995)
Yoshimi Egawa, Preben D. Vestergaard
Spanning trees in a cactus. Discret. Math. 110 (1-3) (1992)
Yoshimi Egawa, Akira Saito
Contractible edges in non-separating cycles. Comb. 11 (4) (1991)
Yoshimi Egawa, Katsuhiro Ota
free graphs. J. Graph Theory 15 (3) (1991)
Yoshimi Egawa
/4]. Graphs Comb. 7 (1) (1991)
Yoshimi Egawa, R. Glas, Stephen C. Locke
-connected graphs. J. Comb. Theory, Ser. B 52 (1) (1991)
Yoshimi Egawa, Atsushi Kaneko, Makoto Matsumoto
A mixed version of Menger's theorem. Comb. 11 (1) (1991)
Yoshimi Egawa, Takashi Miyamoto
. J. Comb. Theory, Ser. B 46 (3) (1989)
Yoshimi Egawa, Hikoe Enomoto, Akira Saito
Factors and induced subgraphs. Discret. Math. 68 (2-3) (1988)
Jin Akiyama, Yoshimi Egawa, Hikoe Enomoto
Preface. Discret. Math. 72 (1-3) (1988)
Yoshimi Egawa, Takashi Miyamoto, Sergio Ruiz
-cyclic digraphs. Graphs Comb. 3 (1) (1987)
Kiyoshi Ando, Yoshimi Egawa, Hirobumi Mizuno
Graphs G for which G and _G are both semidecomposable. Discret. Math. 65 (2) (1987)
Yoshimi Egawa
-2)-connected graph. J. Comb. Theory, Ser. B 42 (3) (1987)
Yoshimi Egawa
Characterization of the cartesian product of complete graphs by convex subgraphs. Discret. Math. 58 (3) (1986)
Yoshimi Egawa, Masatsugu Urabe, Toshihito Fukuda, Seiichiro Nagoya
A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components. Discret. Math. 58 (1) (1986)
Yoshimi Egawa, Hikoe Enomoto, Akira Saito
On component factors. Graphs Comb. 2 (1) (1986)
Yoshimi Egawa, Hikoe Enomoto, Akira Saito
Contracible edges in triangle-free graphs. Comb. 6 (3) (1986)
Yoshimi Egawa
Association Schemes of Quadratic Forms. J. Comb. Theory, Ser. A 38 (1) (1985)
Noga Alon, Yoshimi Egawa
Even edge colorings of a graph. J. Comb. Theory, Ser. B 38 (1) (1985)
Yoshimi Egawa
Characterization of H(n, q) by the Parameters. J. Comb. Theory, Ser. A 31 (2) (1981)