Kiyoshi Ando

Orcid: 0000-0002-8849-4505

According to our database1, Kiyoshi Ando authored at least 55 papers between 1985 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Properly 3-contractible edges in a minimally 3-connected graph.
Discret. Math., May, 2023

2022
A Constructive Characterization of 4-Connected Graphs.
Graphs Comb., 2022

Contractible edges and liftable vertices in a 4-connected graph.
Discret. Math., 2022

2021
Contractible Edges and Contractible Triangles in a 3-Connected Graph.
Graphs Comb., 2021

Contractible edges in <i>k</i>-connected graphs with minimum degree greater than or equal to ⌊3k-12⌋.
Discret. Math., 2021

2020
A new forbidden subgraph for 5-contractible edges.
Discret. Math., 2020

2019
A constructive characterization of contraction critical 8-connected graphs with minimum degree 9.
Discret. Math., 2019

A local condition for k-contractible edges.
Discret. Math., 2019

2018
A new forbidden pair for 6-contractible edges.
Discret. Math., 2018

2017
Small Components of the 5-Subgraph of a Contraction-critically 5-Connected Graph.
Graphs Comb., 2017

2016
Some degree and forbidden subgraph conditions for a graph to have a k-contractible edge.
Discret. Math., 2016

2015
The Removable Edges and the Contractible Subgraphs of 5-Connected Graphs.
Graphs Comb., 2015

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

2012
Minimally contraction-critically 6-connected graphs.
Discret. Math., 2012

2011
Some structural properties of minimally contraction-critically 5-connected graphs.
Discret. Math., 2011

The number of vertices of degree 5 in a contraction-critically 5-connected graph.
Discret. Math., 2011

2009
A local structure theorem on 5-connected graphs.
J. Graph Theory, 2009

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

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

2006
Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph.
Electron. Notes Discret. Math., 2006

Tight quadrangulations on the sphere.
Discret. Math., 2006

2005
Vertices of Degree 5 in a Contraction Critically 5-connected Graph.
Graphs Comb., 2005

Trivially noncontractible edges in a contraction critically 5-connected graph.
Discret. Math., 2005

Contractible Edges in a <i>k</i>-Connected Graph.
Proceedings of the Discrete Geometry, 2005

2003
Vertices of degree 6 in a contraction critically 6-connected graph.
Discret. Math., 2003

Some forbidden subgraph conditions for a graph to have a <i>k</i>-contractible edge.
Discret. Math., 2003

Cycles having the same modularity and removable edges in 2-connected graphs.
Discret. Math., 2003

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

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

Contractible edges in minimally k-connected graphs.
Electron. Notes Discret. Math., 2002

Bandwidth of the cartesian product of two connected graphs.
Discret. Math., 2002

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

On Quadrangulations of Closed Surfaces Covered by Vertices of Degree 3.
Ars Comb., 2002

Self-complementary Graphs with Minimum Degree Two.
Ars Comb., 2002

Contractible Edges and Bowties in a k-Connected Graph.
Ars Comb., 2002

2001
Vertices of degree 6 in a 6-contraction critical graph.
Electron. Notes Discret. Math., 2001

Diagonal flips of pseudo triangulations on the sphere.
Ars Comb., 2001

Minimum length of cycles through specified vertices in graphs with wide-diameter at most d.
Ars Comb., 2001

2000
Wide-diameter and minimum length of fan.
Theor. Comput. Sci., 2000

Contractible edges in a k-connected graph (K<sub>1</sub> + P<sub>4</sub>)-free graph.
Electron. Notes Discret. Math., 2000

1999
A degree condition for the existence of 1-factors in graphs or their complements.
Discret. Math., 1999

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

The seven graphs whose H-transformations are uniquely determined.
Ars Comb., 1997

1996
The bandwidth of a tree with k leaves is at most.
Discret. Math., 1996

A remark on the connectivity of the complement of a 3-connected graph.
Discret. Math., 1996

1994
An upper bound for orders of certain (k, k<sup>_</sup>))-connected graphs.
Discret. Math., 1994

1990
Disjoint subsets of integers having a constant sum.
Discret. Math., 1990

1987
Contractible edges in 3-connected graphs.
J. Comb. Theory B, 1987

Critically (k, k)-connected graphs.
Discret. Math., 1987

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

1986
The six bidecomposable graphs.
J. Graph Theory, 1986

1985
Rao's conjecture on self-complementary graphs with <i>K</i>-factors.
J. Graph Theory, 1985

Eccentric graphs.
Discret. Math., 1985


  Loading...