Existence of 4-factors in star-free graphs with edge-connectivity conditions. - Egawa, Yoshimi; Kotani, Keiko; Yamamoto, Jumpei (AKCE Int. J. Graphs Comb., 2024)

Edges incident with a vertex of degree greater than four and the number of contractible edges in a 4-connected graph. - Egawa, Yoshimi; Nakamura, Shunsuke (Discret. Appl. Math., 2024)

On strict-double-bound graphs and Cartesian products of paths and cycles. - Egawa, Yoshimi; Ogawa, Kenjiro; Ozeki, Kenta; Tagusari, Satoshi; Tsuchiya, Morimasa (Discret. Math. Algorithms Appl., 2024)

Graph grabbing game on graphs with forbidden subgraphs. - Doki, Masayoshi; Egawa, Yoshimi; Matsumoto, Naoki (Discuss. Math. Graph Theory, 2024)

Properly 3-contractible edges in a minimally 3-connected graph. - Ando, Kiyoshi; Egawa, Yoshimi (Discret. Math., 2023)

Contractible Edges and Longest Cycles in 3-Connected Graphs. - Egawa, Yoshimi; Nakamura, Shunsuke (Graphs Comb., 2023)

Minimum Number of Edges Guaranteeing the Existence of a K1, t-Factor in a Graph. - Chiba, Shuya; Egawa, Yoshimi; Fujita, Shinya (Graphs Comb., 2023)

Forbidden triples generating a finite set of graphs with minimum degree three. - Egawa, Yoshimi; Furuya, Michitaka (Discret. Appl. Math., 2022)

Factors of bi-regular bipartite graphs. - Egawa, Yoshimi; Furuya, Michitaka; Kano, Mikio (Discret. Appl. Math., 2022)

Existence of a spanning tree having small diameter. - Egawa, Yoshimi; Furuya, Michitaka; Matsumura, Hajime (Discret. Math., 2021)

Contractible Edges and Contractible Triangles in a 3-Connected Graph. - Ando, Kiyoshi; Egawa, Yoshimi (Graphs Comb., 2021)

Tree in forbidden triples generating a finite set of graphs with high connectivity. - Egawa, Yoshimi; Zhao, Zhixian (AKCE Int. J. Graphs Comb., 2020)

Existence of all generalized fractional (g, f)-factors of graphs. - Egawa, Yoshimi; Kano, Mikio; Yokota, Maho (Discret. Appl. Math., 2020)

Structure of edges in a 4-connected graph not contained in triangles and the number of contractible edges. - Egawa, Yoshimi; Kotani, Keiko; Nakamura, Shunsuke (AKCE Int. J. Graphs Comb., 2018)

The Existence of a Path-Factor without Small Odd Paths. - Egawa, Yoshimi; Furuya, Michitaka (Electron. J. Comb., 2018)

The graph grabbing game on Km, n-trees. - Egawa, Yoshimi; Enomoto, Hikoe; Matsumoto, Naoki (Discret. Math., 2018)

Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles. - Egawa, Yoshimi; Furuya, Michitaka (Discret. Math., 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. - Nakamura, Shunsuke; Egawa, Yoshimi; Kotani, Keiko (Electron. Notes Discret. Math., 2018)

Lower Bound on the Number of Contractible Edges in a 4-Connected Graph with Edges Not Contained in Triangles. - Egawa, Yoshimi; Kotani, Keiko; Nakamura, Shunsuke (Graphs Comb., 2018)

Sufficient conditions for the existence of a path-factor which are related to odd components. - Egawa, Yoshimi; Furuya, Michitaka; Ozeki, Kenta (J. Graph Theory, 2018)

(1, f)-Factors of Graphs with Odd Property. - Egawa, Yoshimi; Kano, Mikio; Yan, Zheng (Graphs Comb., 2016)

Perfect Matchings Avoiding Several Independent Edges in a Star-Free Graph. - Egawa, Yoshimi; Furuya, Michitaka (J. Graph Theory, 2016)

Forbidden Triples Generating a Finite set of 3-Connected Graphs. - Egawa, Yoshimi; Fujisawa, Jun; Furuya, Michitaka; Plummer, Michael D.; Saito, Akira (Electron. J. Comb., 2015)

Perfect matchings avoiding prescribed edges in a star-free graph. - Egawa, Yoshimi; Fujisawa, Jun; Plummer, Michael D.; Saito, Akira; Yamashita, Tomoki (Discret. Math., 2015)

Spanning Trees with Vertices Having Large Degrees. - Egawa, Yoshimi; Ozeki, Kenta (J. Graph Theory, 2015)

A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees. - Egawa, Yoshimi; Ozeki, Kenta (Comb., 2014)

Star-cycle factors of graphs. - Egawa, Yoshimi; Kano, Mikio; Yan, Zheng (Discuss. Math. Graph Theory, 2014)

Forbidden Triples Containing a Complete Graph and a Complete Bipartite Graph of Small Order. - Egawa, Yoshimi; Furuya, Michitaka (Graphs Comb., 2014)

The Average Degree of Minimally Contraction-Critically 5-Connected Graphs. - Ando, Kiyoshi; Egawa, Yoshimi; Kriesell, Matthias (J. Graph Theory, 2014)

Existence of 4-factors in star-free graphs with high connectivity. - Egawa, Yoshimi; Kotani, Keiko (Australas. J Comb., 2013)

Upper Bounds on the Paired Domination Subdivision Number of a Graph. - Egawa, Yoshimi; Furuya, Michitaka; Takatou, Masanori (Graphs Comb., 2013)

Forbidden pairs for 1-s2.0-S0012365X11004766-si1-connected Hamiltonian graphs. - Chen, Guantao; Egawa, Yoshimi; Gould, Ronald J.; Saito, Akira (Discret. Math., 2012)

Toughness of Ka,t-Minor-Free Graphs. - Chen, Guantao; Egawa, Yoshimi; Kawarabayashi, Ken-ichi; Mohar, Bojan; Ota, Katsuhiro (Electron. J. Comb., 2011)

The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity. - Aldred, Robert E. L.; Egawa, Yoshimi; Fujisawa, Jun; Ota, Katsuhiro; Saito, Akira (J. Graph Theory, 2011)

A 2-factor in which each cycle contains a vertex in a specified stable set. - Chiba, Shuya; Egawa, Yoshimi; Yoshimoto, Kiyoshi (Australas. J Comb., 2010)

Arbitrary decompositions into open and closed trails. - Cichacz, Sylwia; Egawa, Yoshimi; Wozniak, Mariusz (Discret. Math., 2009)

5-Shredders in 5-connected graphs. - Egawa, Yoshimi; Okadome, Yumiko; Takatou, Masanori (Discret. Math., 2009)

4-factors in 2-connected star-free graphs. - Egawa, Yoshimi; Kotani, Keiko (Discret. Math., 2009)

On the number of 4-contractible edges in 4-connected graphs. - Ando, Kiyoshi; Egawa, Yoshimi; Kawarabayashi, Ken-ichi; Kriesell, Matthias (J. Comb. Theory B, 2009)

Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph. - Ando, Kiyoshi; Egawa, Yoshimi (Discret. Math., 2008)

Edges not contained in triangles and the number of contractible edges in a 4-connected graph. - Ando, Kiyoshi; Egawa, Yoshimi (Discret. Math., 2008)

K1, 3-factors in graphs. - Egawa, Yoshimi; Fujita, Shinya; Ota, Katsuhiro (Discret. Math., 2008)

On a Spanning Tree with Specified Leaves. - Egawa, Yoshimi; Matsuda, Haruhide; Yamashita, Tomoki; Yoshimoto, Kiyoshi (Graphs Comb., 2008)

k-shredders in k-connected graphs. - Egawa, Yoshimi (J. Graph Theory, 2008)

Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs. - Egawa, Yoshimi; Inoue, Katsumi; Kawarabayashi, Ken-ichi (SIAM J. Discret. Math., 2008)

Independence number and vertex-disjoint cycles. - Egawa, Yoshimi; Enomoto, Hikoe; Jendrol', Stanislav; Ota, Katsuhiro; Schiermeyer, Ingo (Discret. Math., 2007)

Contractible Edges in a 4-Connected Graph with Vertices of Degree Greater Than Four. - Ando, Kiyoshi; Egawa, Yoshimi (Graphs Comb., 2007)

A bound on the order of a graph when both the graph and its complement are contraction-critically k-connected. - Egawa, Yoshimi; Tsugaki, Masao (Australas. J Comb., 2005)

Existence of two disjoint long cycles in graphs. - Egawa, Yoshimi; Fujita, Shinya; Kawarabayashi, Ken-ichi; Wang, Hong (Discret. Math., 2005)

Maximum number of edges in a critically k-connected graph. - Ando, Kiyoshi; Egawa, Yoshimi (Discret. Math., 2003)

Covering vertices of a graph by k disjoint cycles. - Egawa, Yoshimi; Hagita, Mariko; Kawarabayashi, Ken-ichi; Wang, Hong (Discret. Math., 2003)

Two-factors each component of which contains a specified vertex. - Egawa, Yoshimi; Enomoto, Hikoe; Faudree, Ralph J.; Li, Hao; Schiermeyer, Ingo (J. Graph Theory, 2003)

Graph decompositions through prescribed vertices without isolates. - Egawa, Yoshimi; Enomoto, Hikoe; Tokushige, Norihide (Ars Comb., 2002)

Path factors in claw-free graphs. - Ando, Kiyoshi; Egawa, Yoshimi; Kaneko, Atsushi; Kawarabayashi, Ken-ichi; Matsuda, Haruhide (Discret. Math., 2002)

Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs. - Egawa, Yoshimi; Inoue, Katsumi; Kawarabayashi, Ken-ichi (Electron. Notes Discret. Math., 2002)

Graphs G for which both G and G- are Contraction Critically k-Connected. - Akiyama, Jin; Ando, Kiyoshi; Egawa, Yoshimi (Graphs Comb., 2002)

Fan-type theorem for path-connectivity. - Hu, Zhiquan; Tian, Feng; Wei, Bing; Egawa, Yoshimi; Hirohata, Kazuhide (J. Graph Theory, 2002)

Vertex-Disjoint Paths in Graphs. - Egawa, Yoshimi; Ota, Katsuhiro (Ars Comb., 2001)

Vertex-Disjoint Cycles Containing Specified Edges. - Egawa, Yoshimi; Faudree, Ralph J.; Györi, Ervin; Ishigami, Yoshiyasu; Schelp, Richard H.; Wang, Hong (Graphs Comb., 2000)

Radius of (2k-1)-Connected Graphs. - Egawa, Yoshimi; Inoue, Katsumi (Ars Comb., 1999)

Graph Labelings in Boolean Lattices. - Egawa, Yoshimi; Miyamoto, Masahiko (Ars Comb., 1999)

Vertex-disjoint claws in graphs. - Egawa, Yoshimi; Ota, Katsuhiro (Discret. Math., 1999)

Contractible Cycles in Graphs with Girth at Least 5. - Egawa, Yoshimi (J. Comb. Theory B, 1998)

The minimum number of edges in a vertex diameter-2-critical graph. - Ando, Kiyoshi; Egawa, Yoshimi (Discret. Math., 1997)

Contractible cycles in graphs with large minimum degree. - Egawa, Yoshimi (Discret. Math., 1997)

Star partitions of graphs. - Egawa, Yoshimi; Kano, Mikio; Kelmans, Alexander K. (J. Graph Theory, 1997)

Sufficient conditions for graphs to have (g, f)-factors. - Egawa, Yoshimi; Kano, Mikio (Discret. Math., 1996)

Vertex-Disjoint Cycles of the Same Length. - Egawa, Yoshimi (J. Comb. Theory B, 1996)

Essential independent sets and Hamiltonian cycles. - Chen, Guantao; Egawa, Yoshimi; Liu, Xin; Saito, Akira (J. Graph Theory, 1996)

Non-Contractible Edges in A 3-Connected Graph. - Egawa, Yoshimi; Ota, Katsuhiro; Saito, Akira; Yu, Xingxing (Comb., 1995)

The maximal number of inducedr-partite subgraphs. - Bollobás, Béla; Egawa, Yoshimi; Harris, Andrew J.; Jin, Guoping (Graphs Comb., 1995)

Spanning trees in a cactus. - Egawa, Yoshimi; Vestergaard, Preben D. (Discret. Math., 1992)

A mixed version of Menger's theorem. - Egawa, Yoshimi; Kaneko, Atsushi; Matsumoto, Makoto (Comb., 1991)

Contractible edges in non-separating cycles. - Egawa, Yoshimi; Saito, Akira (Comb., 1991)

Contractible edges inn-connected graphs with minimum degree greater than or equal to [5n/4]. - Egawa, Yoshimi (Graphs Comb., 1991)

Cycles and paths through specified vertices in k-connected graphs. - Egawa, Yoshimi; Glas, R.; Locke, Stephen C. (J. Comb. Theory B, 1991)

Regular factors in K1, n free graphs. - Egawa, Yoshimi; Ota, Katsuhiro (J. Graph Theory, 1991)

The longest cycles in a graph G with minimum degree at least |G|/k. - Egawa, Yoshimi; Miyamoto, Takashi (J. Comb. Theory B, 1989)

Factors and induced subgraphs. - Egawa, Yoshimi; Enomoto, Hikoe; Saito, Akira (Discret. Math., 1988)

Preface. - Akiyama, Jin; Egawa, Yoshimi; Enomoto, Hikoe (Discret. Math., 1988)

Graphs G for which G and _G are both semidecomposable. - Ando, Kiyoshi; Egawa, Yoshimi; Mizuno, Hirobumi (Discret. Math., 1987)

On randomlyn-cyclic digraphs. - Egawa, Yoshimi; Miyamoto, Takashi; Ruiz, Sergio (Graphs Comb., 1987)

Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph. - Egawa, Yoshimi (J. Comb. Theory B, 1987)

Contracible edges in triangle-free graphs. - Egawa, Yoshimi; Enomoto, Hikoe; Saito, Akira (Comb., 1986)

A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components. - Egawa, Yoshimi; Urabe, Masatsugu; Fukuda, Toshihito; Nagoya, Seiichiro (Discret. Math., 1986)

Characterization of the cartesian product of complete graphs by convex subgraphs. - Egawa, Yoshimi (Discret. Math., 1986)

On component factors. - Egawa, Yoshimi; Enomoto, Hikoe; Saito, Akira (Graphs Comb., 1986)

Association Schemes of Quadratic Forms. - Egawa, Yoshimi (J. Comb. Theory A, 1985)

Even edge colorings of a graph. - Alon, Noga; Egawa, Yoshimi (J. Comb. Theory B, 1985)

Characterization of H(n, q) by the Parameters. - Egawa, Yoshimi (J. Comb. Theory A, 1981)