Yoshimi Egawa

According to our database1, Yoshimi Egawa authored at least 76 papers between 1981 and 2018.

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

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

Lower Bound on the Number of Contractible Edges in a 4-Connected Graph with Edges Not Contained in Triangles.
Graphs and Combinatorics, 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.
Electronic Notes in Discrete Mathematics, 2018

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

The graph grabbing game on Km, n-trees.
Discrete Mathematics, 2018

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

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

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

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

Perfect matchings avoiding prescribed edges in a star-free graph.
Discrete Mathematics, 2015

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

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

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

Star-cycle factors of graphs.
Discussiones Mathematicae Graph Theory, 2014

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

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

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

2012
Forbidden pairs for 1-s2.0-S0012365X11004766-si1-connected Hamiltonian graphs.
Discrete Mathematics, 2012

2011
The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity.
Journal of Graph Theory, 2011

Toughness of Ka,t-Minor-Free Graphs.
Electr. J. Comb., 2011

2010
A 2-factor in which each cycle contains a vertex in a specified stable set.
Australasian J. Combinatorics, 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.
Discrete Mathematics, 2009

4-factors in 2-connected star-free graphs.
Discrete Mathematics, 2009

Arbitrary decompositions into open and closed trails.
Discrete Mathematics, 2009

2008
Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs.
SIAM J. Discrete Math., 2008

k-shredders in k-connected graphs.
Journal of Graph Theory, 2008

On a Spanning Tree with Specified Leaves.
Graphs and Combinatorics, 2008

K1, 3-factors in graphs.
Discrete Mathematics, 2008

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

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

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

Independence number and vertex-disjoint cycles.
Discrete Mathematics, 2007

2005
Existence of two disjoint long cycles in graphs.
Discrete Mathematics, 2005

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

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

Covering vertices of a graph by k disjoint cycles.
Discrete Mathematics, 2003

Maximum number of edges in a critically k-connected graph.
Discrete Mathematics, 2003

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

Graphs G for which both G and G- are Contraction Critically k-Connected.
Graphs and Combinatorics, 2002

Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs.
Electronic Notes in Discrete Mathematics, 2002

Path factors in claw-free graphs.
Discrete Mathematics, 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 and Combinatorics, 2000

1999
Vertex-disjoint claws in graphs.
Discrete Mathematics, 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.
Journal of Graph Theory, 1997

Contractible cycles in graphs with large minimum degree.
Discrete Mathematics, 1997

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

1996
Essential independent sets and Hamiltonian cycles.
Journal of 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.
Discrete Mathematics, 1996

1995
The maximal number of inducedr-partite subgraphs.
Graphs and Combinatorics, 1995

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

1992
Spanning trees in a cactus.
Discrete Mathematics, 1992

1991
Regular factors in K1, n free graphs.
Journal of Graph Theory, 1991

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

Contractible edges inn-connected graphs with minimum degree greater than or equal to [5n/4].
Graphs and Combinatorics, 1991

Contractible edges in non-separating cycles.
Combinatorica, 1991

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

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

1988
Factors and induced subgraphs.
Discrete Mathematics, 1988

Preface.
Discrete Mathematics, 1988

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

On randomlyn-cyclic digraphs.
Graphs and Combinatorics, 1987

Graphs G for which G and _G are both semidecomposable.
Discrete Mathematics, 1987

1986
On component factors.
Graphs and Combinatorics, 1986

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

Characterization of the cartesian product of complete graphs by convex subgraphs.
Discrete Mathematics, 1986

Contracible edges in triangle-free graphs.
Combinatorica, 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...