Yoshimi Egawa

According to our database1, Yoshimi Egawa authored at least 79 papers between 1981 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Existence of a spanning tree having small diameter.
Discret. Math., 2021

2020
Existence of all generalized fractional (g, f)-factors of graphs.
Discret. Appl. Math., 2020

Tree in forbidden triples generating a finite set of graphs with high connectivity.
AKCE Int. J. Graphs Comb., 2020

2018
Sufficient conditions for the existence of a path-factor which are related to odd components.
J. Graph Theory, 2018

Lower Bound on the Number of Contractible Edges in a 4-Connected Graph with Edges Not Contained in Triangles.
Graphs Comb., 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.
Electron. Notes Discret. Math., 2018

Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles.
Discret. Math., 2018

The graph grabbing game on Km, n-trees.
Discret. Math., 2018

The Existence of a Path-Factor without Small Odd Paths.
Electron. J. Comb., 2018

Structure of edges in a 4-connected graph not contained in triangles and the number of contractible edges.
AKCE Int. J. Graphs Comb., 2018

2016
Perfect Matchings Avoiding Several Independent Edges in a Star-Free Graph.
J. Graph Theory, 2016

(1, f)-Factors of Graphs with Odd Property.
Graphs Comb., 2016

2015
Spanning Trees with Vertices Having Large Degrees.
J. Graph Theory, 2015

Perfect matchings avoiding prescribed edges in a star-free graph.
Discret. Math., 2015

Forbidden Triples Generating a Finite set of 3-Connected Graphs.
Electron. J. Comb., 2015

2014
The Average Degree of Minimally Contraction-Critically 5-Connected Graphs.
J. Graph Theory, 2014

Forbidden Triples Containing a Complete Graph and a Complete Bipartite Graph of Small Order.
Graphs Comb., 2014

Star-cycle factors of graphs.
Discuss. Math. Graph Theory, 2014

A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees.
Comb., 2014

2013
Upper Bounds on the Paired Domination Subdivision Number of a Graph.
Graphs Comb., 2013

Existence of 4-factors in star-free graphs with high connectivity.
Australas. J Comb., 2013

2012
Forbidden pairs for 1-s2.0-S0012365X11004766-si1-connected Hamiltonian graphs.
Discret. Math., 2012

2011
The existence of a 2-factor in <i>K</i><sub>1, <i>n</i></sub>-free graphs with large connectivity and large edge-connectivity.
J. Graph Theory, 2011

Toughness of <i>K<sub>a,t</sub></i>-Minor-Free Graphs.
Electron. J. Comb., 2011

2010
A 2-factor in which each cycle contains a vertex in a specified stable set.
Australas. J Comb., 2010

2009
On the number of 4-contractible edges in 4-connected graphs.
J. Comb. Theory, Ser. B, 2009

5-Shredders in 5-connected graphs.
Discret. Math., 2009

4-factors in 2-connected star-free graphs.
Discret. Math., 2009

Arbitrary decompositions into open and closed trails.
Discret. Math., 2009

2008
<i>k</i>-shredders in <i>k</i>-connected graphs.
J. Graph Theory, 2008

On a Spanning Tree with Specified Leaves.
Graphs Comb., 2008

K<sub>1, 3</sub>-factors in graphs.
Discret. Math., 2008

Edges not contained in triangles and the number of contractible edges in a 4-connected graph.
Discret. Math., 2008

Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph.
Discret. Math., 2008

2007
Contractible Edges in a 4-Connected Graph with Vertices of Degree Greater Than Four.
Graphs Comb., 2007

Independence number and vertex-disjoint cycles.
Discret. Math., 2007

2005
Existence of two disjoint long cycles in graphs.
Discret. Math., 2005

A bound on the order of a graph when both the graph and its complement are contraction-critically k-connected.
Australas. J Comb., 2005

2003
Two-factors each component of which contains a specified vertex.
J. Graph Theory, 2003

Covering vertices of a graph by k disjoint cycles.
Discret. Math., 2003

Maximum number of edges in a critically <i>k</i>-connected graph.
Discret. Math., 2003

2002
Fan-type theorem for path-connectivity.
J. Graph Theory, 2002

Graphs G for which both G and G<sup>-</sup> are Contraction Critically k-Connected.
Graphs Comb., 2002

Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs.
Electron. Notes Discret. Math., 2002

Path factors in claw-free graphs.
Discret. Math., 2002

Graph decompositions through prescribed vertices without isolates.
Ars Comb., 2002

2001
Vertex-Disjoint Paths in Graphs.
Ars Comb., 2001

2000
Vertex-Disjoint Cycles Containing Specified Edges.
Graphs Comb., 2000

1999
Vertex-disjoint claws in graphs.
Discret. Math., 1999

Graph Labelings in Boolean Lattices.
Ars Comb., 1999

Radius of (2k-1)-Connected Graphs.
Ars Comb., 1999

1998
Contractible Cycles in Graphs with Girth at Least 5.
J. Comb. Theory, Ser. B, 1998

1997
Star partitions of graphs.
J. Graph Theory, 1997

Contractible cycles in graphs with large minimum degree.
Discret. Math., 1997

The minimum number of edges in a vertex diameter-2-critical graph.
Discret. Math., 1997

1996
Essential independent sets and Hamiltonian cycles.
J. Graph Theory, 1996

Vertex-Disjoint Cycles of the Same Length.
J. Comb. Theory, Ser. B, 1996

Sufficient conditions for graphs to have (g, f)-factors.
Discret. Math., 1996

1995
The maximal number of induced<i>r</i>-partite subgraphs.
Graphs Comb., 1995

Non-Contractible Edges in A 3-Connected Graph.
Comb., 1995

1992
Spanning trees in a cactus.
Discret. Math., 1992

1991
Regular factors in <i>K</i><sub>1, <i>n</i></sub> free graphs.
J. Graph Theory, 1991

Cycles and paths through specified vertices in <i>k</i>-connected graphs.
J. Comb. Theory, Ser. B, 1991

Contractible edges in<i>n</i>-connected graphs with minimum degree greater than or equal to [5<i>n</i>/4].
Graphs Comb., 1991

Contractible edges in non-separating cycles.
Comb., 1991

A mixed version of Menger's theorem.
Comb., 1991

1989
The longest cycles in a graph <i>G</i> with minimum degree at least |<i>G</i>|/<i>k</i>.
J. Comb. Theory, Ser. B, 1989

1988
Factors and induced subgraphs.
Discret. Math., 1988

Preface.
Discret. Math., 1988

1987
Cycles in <i>k</i>-connected graphs whose deletion results in a (<i>k</i>-2)-connected graph.
J. Comb. Theory, Ser. B, 1987

On randomly<i>n</i>-cyclic digraphs.
Graphs Comb., 1987

Graphs G for which G and _G are both semidecomposable.
Discret. Math., 1987

1986
On component factors.
Graphs Comb., 1986

A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components.
Discret. Math., 1986

Characterization of the cartesian product of complete graphs by convex subgraphs.
Discret. Math., 1986

Contracible edges in triangle-free graphs.
Comb., 1986

1985
Association Schemes of Quadratic Forms.
J. Comb. Theory, Ser. A, 1985

Even edge colorings of a graph.
J. Comb. Theory, Ser. B, 1985

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


  Loading...