Yoshimi Egawa

From MaRDI portal
Revision as of 16:22, 9 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Yoshimi Egawa to Yoshimi Egawa: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:234310

Available identifiers

zbMath Open egawa.yoshimiMaRDI QIDQ234310

List of research outcomes





PublicationDate of PublicationType
Existence of 4-factors in star-free graphs with edge-connectivity conditions2024-12-10Paper
Forbidden caterpillars for 3-connected graphs with girth at least five2024-11-28Paper
On strict-double-bound graphs and Cartesian products of paths and cycles2024-11-13Paper
On 2-factors with a specified number of components in line graphs2024-10-18Paper
Edges incident with a vertex of degree greater than four and the number of contractible edges in a 4-connected graph2024-06-21Paper
https://portal.mardi4nfdi.de/entity/Q60720622023-11-29Paper
Properly 3-contractible edges in a minimally 3-connected graph2023-03-10Paper
Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph2023-03-09Paper
Contractible edges and longest cycles in 3-connected graphs2023-03-09Paper
Regular graph and some vertex-deleted subgraph2022-10-22Paper
Factors of bi-regular bipartite graphs2022-10-13Paper
https://portal.mardi4nfdi.de/entity/Q58677582022-09-19Paper
Forbidden triples generating a finite set of graphs with minimum degree three2022-08-24Paper
https://portal.mardi4nfdi.de/entity/Q50715782022-04-22Paper
Contractible edges and contractible triangles in a 3-connected graph2021-11-25Paper
Tree in forbidden triples generating a finite set of graphs with high connectivity2021-10-05Paper
Existence of a spanning tree having small diameter2021-09-06Paper
Existence of all generalized fractional \((g, f)\)-factors of graphs2020-06-29Paper
Path-factors involving paths of order seven and nine2019-07-22Paper
Structure of edges in a 4-connected graph not contained in triangles and the number of contractible edges2019-01-25Paper
Lower bound on the number of contractible edges in a 4-connected graph with edges not contained in triangles2019-01-11Paper
Sufficient conditions for the existence of a path‐factor which are related to odd components2019-01-03Paper
Edges incident with a vertex of degree greater than four and a lower bound on the number of contractible edges in a 4-connected graph2018-10-11Paper
Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles2018-06-07Paper
The existence of a path-factor without small odd paths2018-05-25Paper
The graph grabbing game on \(K_{m, n}\)-trees2018-04-19Paper
https://portal.mardi4nfdi.de/entity/Q53742472018-04-10Paper
Perfect Matchings Avoiding Several Independent Edges in a Star-Free Graph2016-06-10Paper
\((1,f)\)-factors of graphs with odd property2016-03-02Paper
Forbidden triples generating a finite set of 3-connected graphs2015-08-27Paper
Perfect matchings avoiding prescribed edges in a star-free graph2015-08-05Paper
Spanning Trees with Vertices Having Large Degrees2015-07-23Paper
4-factors in graphs which do not contain a small star2015-02-16Paper
https://portal.mardi4nfdi.de/entity/Q29260922014-10-29Paper
Forbidden triples containing a complete graph and a complete bipartite graph of small order2014-09-19Paper
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees2014-08-14Paper
The Average Degree of Minimally Contraction‐Critically 5‐Connected Graphs2014-05-22Paper
Star-cycle factors of graphs2014-04-02Paper
https://portal.mardi4nfdi.de/entity/Q28693122014-01-03Paper
https://portal.mardi4nfdi.de/entity/Q28580802013-11-19Paper
Upper bounds on the paired domination subdivision number of a graph2013-07-19Paper
Forbidden pairs for \(k\)-connected Hamiltonian graphs2012-03-16Paper
The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity2011-10-12Paper
Toughness of \(K_{a,t}\)-minor-free graphs2011-07-29Paper
https://portal.mardi4nfdi.de/entity/Q35658702010-06-07Paper
4-factors in 2-connected star-free graphs2009-12-15Paper
Arbitrary decompositions into open and closed trails2009-06-17Paper
5-shredders in 5-connected graphs2009-06-17Paper
On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs2009-04-21Paper
k-shredders ink-connected graphs2009-02-20Paper
\(K_{1,3}\)-factors in graphs2009-01-28Paper
Edges not contained in triangles and the number of contractible edges in a 4-connected graph2009-01-28Paper
On the number of 4-contractible edges in 4-connected graphs2009-01-21Paper
Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs2008-12-05Paper
Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph2008-07-11Paper
https://portal.mardi4nfdi.de/entity/Q35094002008-07-01Paper
On a spanning tree with specified leaves2008-04-16Paper
https://portal.mardi4nfdi.de/entity/Q54572522008-04-14Paper
\(k\)-factors containing and avoiding specified sets of edges2008-02-05Paper
Contractible edges in a 4-connected graph with vertices of degree greater than four2007-07-19Paper
Independence number and vertex-disjoint cycles2007-04-26Paper
Vertex-disjoint cycles containing specified vertices in a graph2006-10-12Paper
Existence of two disjoint long cycles in graphs2006-01-10Paper
https://portal.mardi4nfdi.de/entity/Q57085722005-11-18Paper
https://portal.mardi4nfdi.de/entity/Q54614502005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q54614942005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q30252042005-07-13Paper
Covering vertices of a graph by \(k\) disjoint cycles2003-09-04Paper
Two‐factors each component of which contains a specified vertex2003-07-31Paper
Graphs \(G\) for which both \(G\) and \(\overline {G}\) are contraction critically \(k\)-connected2003-03-27Paper
Maximum number of edges in a critically \(k\)-connected graph2003-03-16Paper
Fan‐type theorem for path‐connectivity2002-07-01Paper
Path factors in claw-free graphs2002-03-13Paper
https://portal.mardi4nfdi.de/entity/Q27609832001-12-17Paper
https://portal.mardi4nfdi.de/entity/Q27610462001-12-17Paper
Vertex-disjoint cycles containing specified edges2001-01-02Paper
Contractible cycles in graphs with girth at least 52000-06-25Paper
Vertex-disjoint claws in graphs2000-04-10Paper
Graph labelings in elementary abelian 2-groups1998-03-18Paper
https://portal.mardi4nfdi.de/entity/Q43442051997-12-08Paper
The minimum number of edges in a vertex diameter-2-critical graph1997-11-09Paper
Contractible cycles in graphs with large minimum degree1997-08-10Paper
Sufficient conditions for graphs to have \((g,f)\)-factors1996-12-09Paper
Vertex-disjoint cycles of the same length1996-10-14Paper
Essential independent sets and Hamiltonian cycles1996-02-25Paper
Non-contractible edges in a 3-connected graph1995-10-17Paper
The maximal number of induced \(r\)-partite subgraphs1995-05-11Paper
https://portal.mardi4nfdi.de/entity/Q42744361995-01-26Paper
https://portal.mardi4nfdi.de/entity/Q42945831994-05-17Paper
Spanning trees in a cactus1993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40007731992-09-26Paper
A mixed version of Menger's theorem1992-06-27Paper
Contractible edges in non-separating cycles1992-06-27Paper
Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4\)]1992-06-25Paper
Regular factors in K1,n free graphs1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39788261992-06-25Paper
Cycles and paths through specified vertices in k-connected graphs1991-01-01Paper
The longest cycles in a graph G with minimum degree at least \(| G| /k\)1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32113471989-01-01Paper
Preface1988-01-01Paper
Factors and induced subgraphs1988-01-01Paper
Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph1987-01-01Paper
On randomly n-cyclic digraphs1987-01-01Paper
Graphs G for which G and \(\bar G\) are both semidecomposable1987-01-01Paper
Characterization of the Cartesian product of complete graphs by convex subgraphs1986-01-01Paper
A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components1986-01-01Paper
On component factors1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37911871986-01-01Paper
Even edge colorings of a graph1985-01-01Paper
Automorphism groups of multilinear mappings1985-01-01Paper
Association schemes of quadratic forms1985-01-01Paper
Automorphism groups of \(\Sigma _{n+1}\)-invariant trilinear forms1985-01-01Paper
Standard subgroups of type \(2\Omega+(8,2)\)1982-01-01Paper
Nonnegative Matrices A Such that $Ax = b$ has Nonnegative Best Approximate Solution1982-01-01Paper
Characterization of H(n,q) by the parameters1981-01-01Paper
Standard components of type M241981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41722091977-01-01Paper
Forbidden subgraphs generating a finite set of graphs with minimum degree three and large girthN/APaper

Research outcomes over time

This page was built for person: Yoshimi Egawa