# Yoshimi Egawa

According to our database

Collaborative distances:

^{1}, Yoshimi Egawa authored at least 88 papers between 1981 and 2024.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2024

Discuss. Math. Graph Theory, 2024

Edges incident with a vertex of degree greater than four and the number of contractible edges in a 4-connected graph.

Discret. Appl. Math., 2024

AKCE Int. J. Graphs Comb., 2024

2023

Discret. Math., May, 2023

Minimum Number of Edges Guaranteeing the Existence of a K<sub>1, t</sub>-Factor in a Graph.

Graphs Comb., April, 2023

Graphs Comb., February, 2023

2022

Discret. Appl. Math., 2022

Discret. Appl. Math., 2022

2021

Graphs Comb., 2021

Discret. Math., 2021

2020

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

Discret. Math., 2018

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

J. Graph Theory, 2016

Graphs Comb., 2016

2015

J. Graph Theory, 2015

Discret. Math., 2015

Electron. J. Comb., 2015

2014

J. Graph Theory, 2014

Forbidden Triples Containing a Complete Graph and a Complete Bipartite Graph of Small Order.

Graphs Comb., 2014

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

Graphs Comb., 2013

Australas. J Comb., 2013

2012

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

Electron. J. Comb., 2011

2010

Australas. J Comb., 2010

2009

J. Comb. Theory B, 2009

Discret. Math., 2009

Discret. Math., 2009

Discret. Math., 2009

2008

J. Graph Theory, 2008

Graphs Comb., 2008

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

Discret. Math., 2007

2005

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

J. Graph Theory, 2003

Discret. Math., 2003

Discret. Math., 2003

2002

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

Discret. Math., 2002

Graph decompositions through prescribed vertices without isolates.

Ars Comb., 2002

2001

Vertex-Disjoint Paths in Graphs.

Ars Comb., 2001

2000

Graphs Comb., 2000

1999

Discret. Math., 1999

Graph Labelings in Boolean Lattices.

Ars Comb., 1999

Radius of (2k-1)-Connected Graphs.

Ars Comb., 1999

1998

J. Comb. Theory B, 1998

1997

J. Graph Theory, 1997

Discret. Math., 1997

Discret. Math., 1997

1996

J. Graph Theory, 1996

J. Comb. Theory B, 1996

Discret. Math., 1996

1995

Graphs Comb., 1995

Comb., 1995

1992

Discret. Math., 1992

1991

J. Graph Theory, 1991

J. Comb. Theory 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

Comb., 1991

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 B, 1989

1988

Discret. Math., 1988

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 B, 1987

Graphs Comb., 1987

Discret. Math., 1987

1986

Graphs Comb., 1986

A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components.

Discret. Math., 1986

Discret. Math., 1986

Comb., 1986

1985

J. Comb. Theory A, 1985

J. Comb. Theory B, 1985

1981

J. Comb. Theory A, 1981