default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYoshimi Egawa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j90]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): 41-47 (2024)- [j89]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: 142-158 (2024) - [j88]Yoshimi Egawa, Kenjiro Ogawa, Kenta Ozeki, Satoshi Tagusari, Morimasa Tsuchiya:
On strict-double-bound graphs and Cartesian products of paths and cycles. Discret. Math. Algorithms Appl. 16(5): 2350058:1-2350058:6 (2024) - [j87]Masayoshi Doki, Yoshimi Egawa, Naoki Matsumoto:
Graph grabbing game on graphs with forbidden subgraphs. Discuss. Math. Graph Theory 44(1): 171 (2024) - 2023
- [j86]Kiyoshi Ando, Yoshimi Egawa:
Properly 3-contractible edges in a minimally 3-connected graph. Discret. Math. 346(5): 113321 (2023) - [j85]Yoshimi Egawa, Shunsuke Nakamura:
Contractible Edges and Longest Cycles in 3-Connected Graphs. Graphs Comb. 39(1): 14 (2023) - [j84]Shuya Chiba, Yoshimi Egawa, Shinya Fujita:
Minimum Number of Edges Guaranteeing the Existence of a K1, t-Factor in a Graph. Graphs Comb. 39(2): 27 (2023) - 2022
- [j83]Yoshimi Egawa, Michitaka Furuya:
Forbidden triples generating a finite set of graphs with minimum degree three. Discret. Appl. Math. 320: 282-295 (2022) - [j82]Yoshimi Egawa, Michitaka Furuya, Mikio Kano:
Factors of bi-regular bipartite graphs. Discret. Appl. Math. 322: 268-272 (2022) - 2021
- [j81]Yoshimi Egawa, Michitaka Furuya, Hajime Matsumura:
Existence of a spanning tree having small diameter. Discret. Math. 344(11): 112548 (2021) - [j80]Kiyoshi Ando, Yoshimi Egawa:
Contractible Edges and Contractible Triangles in a 3-Connected Graph. Graphs Comb. 37(5): 1807-1821 (2021) - 2020
- [j79]Yoshimi Egawa, Zhixian Zhao:
Tree in forbidden triples generating a finite set of graphs with high connectivity. AKCE Int. J. Graphs Comb. 17(1): 443-446 (2020) - [j78]Yoshimi Egawa, Mikio Kano, Maho Yokota:
Existence of all generalized fractional (g, f)-factors of graphs. Discret. Appl. Math. 283: 265-271 (2020) - 2018
- [j77]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): 202-210 (2018) - [j76]Yoshimi Egawa, Michitaka Furuya:
The Existence of a Path-Factor without Small Odd Paths. Electron. J. Comb. 25(1): 1 (2018) - [j75]Yoshimi Egawa, Hikoe Enomoto, Naoki Matsumoto:
The graph grabbing game on Km, n-trees. Discret. Math. 341(6): 1555-1560 (2018) - [j74]Yoshimi Egawa, Michitaka Furuya:
Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles. Discret. Math. 341(8): 2276-2284 (2018) - [j73]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: 23-28 (2018) - [j72]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): 965-987 (2018) - [j71]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): 327-340 (2018) - 2016
- [j70]Yoshimi Egawa, Mikio Kano, Zheng Yan:
(1, f)-Factors of Graphs with Odd Property. Graphs Comb. 32(1): 103-110 (2016) - [j69]Yoshimi Egawa, Michitaka Furuya:
Perfect Matchings Avoiding Several Independent Edges in a Star-Free Graph. J. Graph Theory 82(1): 33-44 (2016) - 2015
- [j68]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): 3 (2015) - [j67]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): 2260-2274 (2015) - [j66]Yoshimi Egawa, Kenta Ozeki:
Spanning Trees with Vertices Having Large Degrees. J. Graph Theory 79(3): 213-221 (2015) - 2014
- [j65]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): 47-60 (2014) - [j64]Yoshimi Egawa, Mikio Kano, Zheng Yan:
Star-cycle factors of graphs. Discuss. Math. Graph Theory 34(1): 193-198 (2014) - [j63]Yoshimi Egawa, Michitaka Furuya:
Forbidden Triples Containing a Complete Graph and a Complete Bipartite Graph of Small Order. Graphs Comb. 30(5): 1149-1162 (2014) - [j62]Kiyoshi Ando, Yoshimi Egawa, Matthias Kriesell:
The Average Degree of Minimally Contraction-Critically 5-Connected Graphs. J. Graph Theory 75(4): 331-354 (2014) - 2013
- [j61]Yoshimi Egawa, Keiko Kotani:
Existence of 4-factors in star-free graphs with high connectivity. Australas. J Comb. 55: 299-314 (2013) - [j60]Yoshimi Egawa, Michitaka Furuya, Masanori Takatou:
Upper Bounds on the Paired Domination Subdivision Number of a Graph. Graphs Comb. 29(4): 843-856 (2013) - 2012
- [j59]Guantao Chen, Yoshimi Egawa, Ronald J. Gould, Akira Saito:
Forbidden pairs for 1-s2.0-S0012365X11004766-si1-connected Hamiltonian graphs. Discret. Math. 312(5): 938-942 (2012) - 2011
- [j58]Guantao Chen, Yoshimi Egawa, Ken-ichi Kawarabayashi, Bojan Mohar, Katsuhiro Ota:
Toughness of Ka,t-Minor-Free Graphs. Electron. J. Comb. 18(1) (2011) - [j57]Robert E. L. Aldred, Yoshimi Egawa, Jun Fujisawa, Katsuhiro Ota, Akira Saito:
The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity. J. Graph Theory 68(1): 77-89 (2011) - 2010
- [j56]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: 203-210 (2010) - 2009
- [j55]Sylwia Cichacz, Yoshimi Egawa, Mariusz Wozniak:
Arbitrary decompositions into open and closed trails. Discret. Math. 309(6): 1511-1516 (2009) - [j54]Yoshimi Egawa, Yumiko Okadome, Masanori Takatou:
5-Shredders in 5-connected graphs. Discret. Math. 309(6): 1565-1574 (2009) - [j53]Yoshimi Egawa, Keiko Kotani:
4-factors in 2-connected star-free graphs. Discret. Math. 309(21): 6265-6270 (2009) - [j52]Kiyoshi Ando, Yoshimi Egawa, Ken-ichi Kawarabayashi, Matthias Kriesell:
On the number of 4-contractible edges in 4-connected graphs. J. Comb. Theory B 99(1): 97-109 (2009) - 2008
- [j51]Kiyoshi Ando, Yoshimi Egawa:
Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph. Discret. Math. 308(16): 3449-3460 (2008) - [j50]Kiyoshi Ando, Yoshimi Egawa:
Edges not contained in triangles and the number of contractible edges in a 4-connected graph. Discret. Math. 308(23): 5463-5472 (2008) - [j49]Yoshimi Egawa, Shinya Fujita, Katsuhiro Ota:
K1, 3-factors in graphs. Discret. Math. 308(24): 5965-5973 (2008) - [j48]Yoshimi Egawa, Haruhide Matsuda, Tomoki Yamashita, Kiyoshi Yoshimoto:
On a Spanning Tree with Specified Leaves. Graphs Comb. 24(1): 13-18 (2008) - [j47]Yoshimi Egawa:
k-shredders in k-connected graphs. J. Graph Theory 59(3): 239-259 (2008) - [j46]Yoshimi Egawa, Katsumi Inoue, Ken-ichi Kawarabayashi:
Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs. SIAM J. Discret. Math. 21(4): 1061-1070 (2008) - 2007
- [j45]Yoshimi Egawa, Hikoe Enomoto, Stanislav Jendrol', Katsuhiro Ota, Ingo Schiermeyer:
Independence number and vertex-disjoint cycles. Discret. Math. 307(11-12): 1493-1498 (2007) - [j44]Kiyoshi Ando, Yoshimi Egawa:
Contractible Edges in a 4-Connected Graph with Vertices of Degree Greater Than Four. Graphs Comb. 23(Supplement-1): 99-115 (2007) - 2005
- [j43]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: 105-110 (2005) - [j42]Yoshimi Egawa, Shinya Fujita, Ken-ichi Kawarabayashi, Hong Wang:
Existence of two disjoint long cycles in graphs. Discret. Math. 305(1-3): 154-169 (2005) - 2003
- [j41]Kiyoshi Ando, Yoshimi Egawa:
Maximum number of edges in a critically k-connected graph. Discret. Math. 260(1-3): 1-25 (2003) - [j40]Yoshimi Egawa, Mariko Hagita, Ken-ichi Kawarabayashi, Hong Wang:
Covering vertices of a graph by k disjoint cycles. Discret. Math. 270(1-3): 114-124 (2003) - [j39]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): 188-198 (2003) - 2002
- [j38]Yoshimi Egawa, Hikoe Enomoto, Norihide Tokushige:
Graph decompositions through prescribed vertices without isolates. Ars Comb. 62 (2002) - [j37]Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda:
Path factors in claw-free graphs. Discret. Math. 243(1-3): 195-200 (2002) - [j36]Yoshimi Egawa, Katsumi Inoue, Ken-ichi Kawarabayashi:
Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs. Electron. Notes Discret. Math. 11: 253-264 (2002) - [j35]Jin Akiyama, Kiyoshi Ando, Yoshimi Egawa:
Graphs G for which both G and G- are Contraction Critically k-Connected. Graphs Comb. 18(4): 693-708 (2002) - [j34]Zhiquan Hu, Feng Tian, Bing Wei, Yoshimi Egawa, Kazuhide Hirohata:
Fan-type theorem for path-connectivity. J. Graph Theory 39(4): 265-282 (2002) - 2001
- [j33]Yoshimi Egawa, Katsuhiro Ota:
Vertex-Disjoint Paths in Graphs. Ars Comb. 61 (2001) - 2000
- [j32]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): 81-92 (2000) - 1999
- [j31]Yoshimi Egawa, Katsumi Inoue:
Radius of (2k-1)-Connected Graphs. Ars Comb. 51 (1999) - [j30]Yoshimi Egawa, Masahiko Miyamoto:
Graph Labelings in Boolean Lattices. Ars Comb. 52 (1999) - [j29]Yoshimi Egawa, Katsuhiro Ota:
Vertex-disjoint claws in graphs. Discret. Math. 197-198: 225-246 (1999) - 1998
- [j28]Yoshimi Egawa:
Contractible Cycles in Graphs with Girth at Least 5. J. Comb. Theory B 74(2): 213-264 (1998) - 1997
- [j27]Kiyoshi Ando, Yoshimi Egawa:
The minimum number of edges in a vertex diameter-2-critical graph. Discret. Math. 167-168: 35-63 (1997) - [j26]Yoshimi Egawa:
Contractible cycles in graphs with large minimum degree. Discret. Math. 171(1-3): 103-119 (1997) - [j25]Yoshimi Egawa, Mikio Kano, Alexander K. Kelmans:
Star partitions of graphs. J. Graph Theory 25(3): 185-190 (1997) - 1996
- [j24]Yoshimi Egawa, Mikio Kano:
Sufficient conditions for graphs to have (g, f)-factors. Discret. Math. 151(1-3): 87-90 (1996) - [j23]Yoshimi Egawa:
Vertex-Disjoint Cycles of the Same Length. J. Comb. Theory B 66(2): 168-200 (1996) - [j22]Guantao Chen, Yoshimi Egawa, Xin Liu, Akira Saito:
Essential independent sets and Hamiltonian cycles. J. Graph Theory 21(2): 243-249 (1996) - 1995
- [j21]Yoshimi Egawa, Katsuhiro Ota, Akira Saito, Xingxing Yu:
Non-Contractible Edges in A 3-Connected Graph. Comb. 15(3): 357-364 (1995) - [j20]Béla Bollobás, Yoshimi Egawa, Andrew J. Harris, Guoping Jin:
The maximal number of inducedr-partite subgraphs. Graphs Comb. 11(1): 1-19 (1995) - 1992
- [j19]Yoshimi Egawa, Preben D. Vestergaard:
Spanning trees in a cactus. Discret. Math. 110(1-3): 269-274 (1992) - 1991
- [j18]Yoshimi Egawa, Atsushi Kaneko, Makoto Matsumoto:
A mixed version of Menger's theorem. Comb. 11(1): 71-74 (1991) - [j17]Yoshimi Egawa, Akira Saito:
Contractible edges in non-separating cycles. Comb. 11(4): 389-392 (1991) - [j16]Yoshimi Egawa:
Contractible edges inn-connected graphs with minimum degree greater than or equal to [5n/4]. Graphs Comb. 7(1): 15-21 (1991) - [j15]Yoshimi Egawa, R. Glas, Stephen C. Locke:
Cycles and paths through specified vertices in k-connected graphs. J. Comb. Theory B 52(1): 20-29 (1991) - [j14]Yoshimi Egawa, Katsuhiro Ota:
Regular factors in K1, n free graphs. J. Graph Theory 15(3): 337-344 (1991) - 1989
- [j13]Yoshimi Egawa, Takashi Miyamoto:
The longest cycles in a graph G with minimum degree at least |G|/k. J. Comb. Theory B 46(3): 356-362 (1989) - 1988
- [j12]Yoshimi Egawa, Hikoe Enomoto, Akira Saito:
Factors and induced subgraphs. Discret. Math. 68(2-3): 179-189 (1988) - [j11]Jin Akiyama, Yoshimi Egawa, Hikoe Enomoto:
Preface. Discret. Math. 72(1-3): 1-2 (1988) - 1987
- [j10]Kiyoshi Ando, Yoshimi Egawa, Hirobumi Mizuno:
Graphs G for which G and _G are both semidecomposable. Discret. Math. 65(2): 109-114 (1987) - [j9]Yoshimi Egawa, Takashi Miyamoto, Sergio Ruiz:
On randomlyn-cyclic digraphs. Graphs Comb. 3(1): 227-238 (1987) - [j8]Yoshimi Egawa:
Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph. J. Comb. Theory B 42(3): 371-377 (1987) - 1986
- [j7]Yoshimi Egawa, Hikoe Enomoto, Akira Saito:
Contracible edges in triangle-free graphs. Comb. 6(3): 269-274 (1986) - [j6]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): 93-95 (1986) - [j5]Yoshimi Egawa:
Characterization of the cartesian product of complete graphs by convex subgraphs. Discret. Math. 58(3): 307-309 (1986) - [j4]Yoshimi Egawa, Hikoe Enomoto, Akira Saito:
On component factors. Graphs Comb. 2(1): 223-225 (1986) - 1985
- [j3]Yoshimi Egawa:
Association Schemes of Quadratic Forms. J. Comb. Theory A 38(1): 1-14 (1985) - [j2]Noga Alon, Yoshimi Egawa:
Even edge colorings of a graph. J. Comb. Theory B 38(1): 93-94 (1985) - 1981
- [j1]Yoshimi Egawa:
Characterization of H(n, q) by the Parameters. J. Comb. Theory A 31(2): 108-125 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
