Kiyoshi Ando

From MaRDI portal
Person:234309

Available identifiers

zbMath Open ando.kiyoshiMaRDI QIDQ234309

List of research outcomes





PublicationDate of PublicationType
Properly 3-contractible edges in a minimally 3-connected graph2023-03-10Paper
A constructive characterization of 4-connected graphs2022-07-22Paper
Contractible edges and contractible triangles in a 3-connected graph2021-11-25Paper
Contractible edges and liftable vertices in a 4-connected graph2021-11-23Paper
Contractible edges in \(k\)-connected graphs with minimum degree greater than or equal to \(\lfloor \frac{ 3 k - 1}{ 2} \rfloor \)2021-06-14Paper
A new forbidden subgraph for 5-contractible edges2020-06-08Paper
A local condition for \(k\)-contractible edges2019-10-17Paper
A constructive characterization of contraction critical 8-connected graphs with minimum degree 92019-09-11Paper
A new forbidden pair for 6-contractible edges2018-09-21Paper
Small components of the 5-subgraph of a contraction-critically 5-connected graph2018-02-14Paper
Contractible edges in a \(k\)-connected graph (\(K_{1} + P_{4}\))-free graph2016-07-01Paper
Some degree and forbidden subgraph conditions for a graph to have a \(k\)-contractible edge2015-10-08Paper
The removable edges and the contractible subgraphs of 5-connected graphs2015-01-20Paper
The average degree of minimally contraction-critically 5-connected graphs2014-05-22Paper
Minimally contraction-critically 6-connected graphs2012-01-11Paper
The number of vertices of degree 5 in a contraction-critically 5-connected graph2011-08-09Paper
Some structural properties of minimally contraction-critically 5-connected graphs2011-05-31Paper
Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph2009-12-15Paper
A local structure theorem on 5-connected graphs2009-02-20Paper
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
Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph2008-07-11Paper
Contractible edges in minimally \(k\)-connected graphs2008-01-28Paper
Contractible Edges in a k-Connected Graph2007-08-28Paper
Contractible edges in a 4-connected graph with vertices of degree greater than four2007-07-19Paper
Vertices of degree 6 in a 6-contraction critical graph2007-05-29Paper
Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34339652007-04-23Paper
Tight quadrangulations on the sphere2006-03-29Paper
https://portal.mardi4nfdi.de/entity/Q57085552005-11-18Paper
https://portal.mardi4nfdi.de/entity/Q54615552005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q54615672005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q54614862005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q54608952005-07-20Paper
Minimum length of cycles through specified vertices in graphs with wide-diameter at most \(d\).2005-07-20Paper
Trivially noncontractible edges in a contraction critically 5-connected graph2005-06-01Paper
Vertices of degree 5 in a contraction critically 5-connected graph2005-05-12Paper
Vertices of degree 6 in a contraction critically 6-connected graph2004-01-05Paper
Some forbidden subgraph conditions for a graph to have a \(k\)-contractible edge2003-06-25Paper
Cycles having the same modularity and removable edges in 2-connected graphs2003-05-25Paper
Graphs \(G\) for which both \(G\) and \(\overline {G}\) are contraction critically \(k\)-connected2003-03-27Paper
Edge-wide-diameter of graphs with diameter \(d\)2003-03-25Paper
Maximum number of edges in a critically \(k\)-connected graph2003-03-16Paper
Bandwidth of the Cartesian product of two connected graphs2002-08-29Paper
Path factors in claw-free graphs2002-03-13Paper
https://portal.mardi4nfdi.de/entity/Q45145532001-03-30Paper
Wide-diameter and minimum length of fan2000-06-04Paper
A degree condition for the existence of 1-factors in graphs or their complements2000-04-10Paper
https://portal.mardi4nfdi.de/entity/Q49400622000-03-01Paper
The minimum number of edges in a vertex diameter-2-critical graph1997-11-09Paper
The bandwidth of a tree with \(k\) leaves is at most \(\lceil \frac k2 \rceil\)1997-02-17Paper
A remark on the connectivity of the complement of a 3-connected graph1996-07-03Paper
An upper bound for orders of certain \((k,\bar k)\)-connected graphs1995-02-01Paper
Disjoint subsets of integers having a constant sum1990-01-01Paper
Critically \((k,k)\)-connected graphs1987-01-01Paper
Contractible edges in 3-connected graphs1987-01-01Paper
Graphs G for which G and \(\bar G\) are both semidecomposable1987-01-01Paper
The six bidecomposable graphs1986-01-01Paper
Eccentric graphs1985-01-01Paper
Rao's conjecture on self-complementary graphs withK-factors1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36808761984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33426171984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39314421981-01-01Paper

Research outcomes over time

This page was built for person: Kiyoshi Ando