Yoshimi Egawa

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