| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Kiyoshi Ando, Shinya Fujita, Ken-ichi Kawarabayashi |
Minimally contraction-critically 6-connected graphs.  |
Discrete Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando, Takashi Iwase |
The number of vertices of degree 5 in a contraction-critically 5-connected graph. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando, Chengfu Qin |
Some structural properties of minimally contraction-critically 5-connected graphs. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando, Yoshimi Egawa, Ken-ichi Kawarabayashi, Matthias Kriesell |
On the number of 4-contractible edges in 4-connected graphs. |
J. Comb. Theory, Ser. B |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando |
Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando |
A local structure theorem on 5-connected graphs. |
Journal of Graph Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando, Yoshimi Egawa |
Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi |
Contractible edges in minimally k-connected graphs. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando, Yoshimi Egawa |
Edges not contained in triangles and the number of contractible edges in a 4-connected graph. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando |
Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph. |
Electronic Notes in Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hideo Komuro, Kiyoshi Ando, Atsuhiro Nakamoto |
Tight quadrangulations on the sphere. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando |
Trivially noncontractible edges in a contraction critically 5-connected graph. |
Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi |
Vertices of Degree 5 in a Contraction Critically 5-connected Graph. |
Graphs and Combinatorics |
2005 |
DBLP DOI BibTeX RDF |
AMS Subject Classification, 05C40 |
| 1 | Kiyoshi Ando |
Contractible Edges in a k-Connected Graph. |
CJCDGCGT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando, Yoshimi Egawa |
Maximum number of edges in a critically k-connected graph. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi |
Vertices of degree 6 in a contraction critically 6-connected graph. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando, Mariko Hagita, Atsushi Kaneko, Mikio Kano, Ken-ichi Kawarabayashi, Akira Saito |
Cycles having the same modularity and removable edges in 2-connected graphs. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando, Ken-ichi Kawarabayashi |
Some forbidden subgraph conditions for a graph to have a k-contractible edge. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi |
Contractible edges in minimally k-connected graphs. |
Electronic Notes in Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Toru Kojima, Kiyoshi Ando |
Bandwidth of the cartesian product of two connected graphs. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda |
Path factors in claw-free graphs. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Jin Akiyama, Kiyoshi Ando, Yoshimi Egawa |
Graphs G for which both G and G- are Contraction Critically k-Connected. |
Graphs and Combinatorics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando, Atsuhiro Nakamoto |
Self-complementary Graphs with Minimum Degree Two. |
Ars Comb. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi, Kiyoshi Yoshiomoto |
Contractible Edges and Bowties in a k-Connected Graph. |
Ars Comb. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Kiyoshi Ando, Atsuhiro Nakamoto |
On Quadrangulations of Closed Surfaces Covered by Vertices of Degree 3. |
Ars Comb. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi |
Vertices of degree 6 in a 6-contraction critical graph. |
Electronic Notes in Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Hideo Komuro, Kiyoshi Ando |
Diagonal flips of pseudo triangulations on the sphere. |
Ars Comb. |
2001 |
DBLP BibTeX RDF |
|
| 1 | Toru Kojima, Kiyoshi Ando |
Minimum length of cycles through specified vertices in graphs with wide-diameter at most d. |
Ars Comb. |
2001 |
DBLP BibTeX RDF |
|
| 1 | Kiyoshi Ando |
Contractible edges in a k-connected graph (K1 + P4)-free graph. |
Electronic Notes in Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Toru Kojima, Kiyoshi Ando |
Wide-diameter and minimum length of fan. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando, Atsushi Kaneko, Tsuyoshi Nishimura |
A degree condition for the existence of 1-factors in graphs or their complements. |
Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando, Yoshimi Egawa |
The minimum number of edges in a vertex diameter-2-critical graph. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando, Hideo Komuro |
The seven graphs whose H-transformations are uniquely determined. |
Ars Comb. |
1997 |
DBLP BibTeX RDF |
|
| 1 | Kiyoshi Ando, Atsushi Kaneko |
A remark on the connectivity of the complement of a 3-connected graph. |
Discrete Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando |
An upper bound for orders of certain (k, k_))-connected graphs. |
Discrete Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando, Severino V. Gervacio, Mikio Kano |
Disjoint subsets of integers having a constant sum. |
Discrete Mathematics |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando, Hikoe Enomoto, Akira Saito |
Contractible edges in 3-connected graphs. |
J. Comb. Theory, Ser. B |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando, Yoshimi Egawa, Hirobumi Mizuno |
Graphs G for which G and _G are both semidecomposable. |
Discrete Mathematics |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Kiyoshi Ando, Yoko Usami |
Critically (k, k)-connected graphs. |
Discrete Mathematics |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Jin Akiyama, Kiyoshi Ando, David Avis |
Eccentric graphs. |
Discrete Mathematics |
1985 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")