default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKiyoshi Ando
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j56]Kiyoshi Ando
, Yoshimi Egawa:
Properly 3-contractible edges in a minimally 3-connected graph. Discret. Math. 346(5): 113321 (2023)- 2022
- [j55]Kiyoshi Ando:
Contractible edges and liftable vertices in a 4-connected graph. Discret. Math. 345(2): 112677 (2022) - [j54]Kiyoshi Ando:
A Constructive Characterization of 4-Connected Graphs. Graphs Comb. 38(4): 118 (2022) - 2021
- [j53]Kiyoshi Ando:
Contractible edges in k-connected graphs with minimum degree greater than or equal to ⌊3k-12⌋. Discret. Math. 344(7): 112416 (2021) - [j52]Kiyoshi Ando, Yoshimi Egawa:
Contractible Edges and Contractible Triangles in a 3-Connected Graph. Graphs Comb. 37(5): 1807-1821 (2021) - 2020
- [j51]Kiyoshi Ando:
A new forbidden subgraph for 5-contractible edges. Discret. Math. 343(8): 111928 (2020)
2010 – 2019
- 2019
- [j50]Chengfu Qin, Weihua He, Kiyoshi Ando:
A constructive characterization of contraction critical 8-connected graphs with minimum degree 9. Discret. Math. 342(11): 3047-3056 (2019) - [j49]Kiyoshi Ando:
A local condition for k-contractible edges. Discret. Math. 342(12) (2019) - 2018
- [j48]Kiyoshi Ando:
A new forbidden pair for 6-contractible edges. Discret. Math. 341(11): 3003-3009 (2018) - 2017
- [j47]Kiyoshi Ando:
Small Components of the 5-Subgraph of a Contraction-critically 5-Connected Graph. Graphs Comb. 33(6): 1485-1497 (2017) - 2016
- [j46]Kiyoshi Ando:
Some degree and forbidden subgraph conditions for a graph to have a k-contractible edge. Discret. Math. 339(1): 207-216 (2016) - 2015
- [j45]Chengfu Qin, Xiaofeng Guo, Kiyoshi Ando:
The Removable Edges and the Contractible Subgraphs of 5-Connected Graphs. Graphs Comb. 31(1): 243-254 (2015) - 2014
- [j44]Kiyoshi Ando, Yoshimi Egawa, Matthias Kriesell:
The Average Degree of Minimally Contraction-Critically 5-Connected Graphs. J. Graph Theory 75(4): 331-354 (2014) - 2012
- [j43]Kiyoshi Ando, Shinya Fujita, Ken-ichi Kawarabayashi:
Minimally contraction-critically 6-connected graphs. Discret. Math. 312(3): 671-679 (2012) - 2011
- [j42]Kiyoshi Ando, Chengfu Qin:
Some structural properties of minimally contraction-critically 5-connected graphs. Discret. Math. 311(13): 1084-1097 (2011) - [j41]Kiyoshi Ando, Takashi Iwase:
The number of vertices of degree 5 in a contraction-critically 5-connected graph. Discret. Math. 311(17): 1925-1939 (2011)
2000 – 2009
- 2009
- [j40]Kiyoshi Ando:
Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph. Discret. Math. 309(22): 6359-6367 (2009) - [j39]Kiyoshi Ando, Yoshimi Egawa, Ken-ichi Kawarabayashi, Matthias Kriesell:
On the number of 4-contractible edges in 4-connected graphs. J. Comb. Theory B 99(1): 97-109 (2009) - [j38]Kiyoshi Ando:
A local structure theorem on 5-connected graphs. J. Graph Theory 60(2): 99-129 (2009) - 2008
- [j37]Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi:
Contractible edges in minimally k-connected graphs. Discret. Math. 308(4): 597-602 (2008) - [j36]Kiyoshi Ando, Yoshimi Egawa:
Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph. Discret. Math. 308(16): 3449-3460 (2008) - [j35]Kiyoshi Ando, Yoshimi Egawa:
Edges not contained in triangles and the number of contractible edges in a 4-connected graph. Discret. Math. 308(23): 5463-5472 (2008) - 2007
- [j34]Kiyoshi Ando, Yoshimi Egawa:
Contractible Edges in a 4-Connected Graph with Vertices of Degree Greater Than Four. Graphs Comb. 23(Supplement-1): 99-115 (2007) - 2006
- [j33]Hideo Komuro, Kiyoshi Ando, Atsuhiro Nakamoto:
Tight quadrangulations on the sphere. Discret. Math. 306(2): 278-283 (2006) - [j32]Kiyoshi Ando:
Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph. Electron. Notes Discret. Math. 24: 25-30 (2006) - 2005
- [j31]Kiyoshi Ando:
Trivially noncontractible edges in a contraction critically 5-connected graph. Discret. Math. 293(1-3): 61-72 (2005) - [j30]Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi:
Vertices of Degree 5 in a Contraction Critically 5-connected Graph. Graphs Comb. 21(1): 27-37 (2005) - [c1]Kiyoshi Ando:
Contractible Edges in a k-Connected Graph. CJCDGCGT 2005: 10-20 - 2003
- [j29]Kiyoshi Ando, Yoshimi Egawa:
Maximum number of edges in a critically k-connected graph. Discret. Math. 260(1-3): 1-25 (2003) - [j28]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. Discret. Math. 265(1-3): 23-30 (2003) - [j27]Kiyoshi Ando, Ken-ichi Kawarabayashi:
Some forbidden subgraph conditions for a graph to have a k-contractible edge. Discret. Math. 267(1-3): 3-11 (2003) - [j26]Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi:
Vertices of degree 6 in a contraction critically 6-connected graph. Discret. Math. 273(1-3): 55-69 (2003) - 2002
- [j25]Kiyoshi Ando, Atsuhiro Nakamoto:
On Quadrangulations of Closed Surfaces Covered by Vertices of Degree 3. Ars Comb. 62 (2002) - [j24]Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi, Kiyoshi Yoshiomoto:
Contractible Edges and Bowties in a k-Connected Graph. Ars Comb. 64: 239- (2002) - [j23]Kiyoshi Ando, Atsuhiro Nakamoto:
Self-complementary Graphs with Minimum Degree Two. Ars Comb. 65 (2002) - [j22]Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda:
Path factors in claw-free graphs. Discret. Math. 243(1-3): 195-200 (2002) - [j21]Toru Kojima, Kiyoshi Ando:
Bandwidth of the cartesian product of two connected graphs. Discret. Math. 252(1-3): 227-235 (2002) - [j20]Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi:
Contractible edges in minimally k-connected graphs. Electron. Notes Discret. Math. 11: 20-29 (2002) - [j19]Jin Akiyama, Kiyoshi Ando, Yoshimi Egawa:
Graphs G for which both G and G- are Contraction Critically k-Connected. Graphs Comb. 18(4): 693-708 (2002) - 2001
- [j18]Toru Kojima, Kiyoshi Ando:
Minimum length of cycles through specified vertices in graphs with wide-diameter at most d. Ars Comb. 58 (2001) - [j17]Hideo Komuro, Kiyoshi Ando:
Diagonal flips of pseudo triangulations on the sphere. Ars Comb. 59 (2001) - [j16]Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi:
Vertices of degree 6 in a 6-contraction critical graph. Electron. Notes Discret. Math. 10: 2-6 (2001) - 2000
- [j15]Kiyoshi Ando:
Contractible edges in a k-connected graph (K1 + P4)-free graph. Electron. Notes Discret. Math. 5: 7-10 (2000) - [j14]Toru Kojima, Kiyoshi Ando:
Wide-diameter and minimum length of fan. Theor. Comput. Sci. 235(2): 257-266 (2000)
1990 – 1999
- 1999
- [j13]Kiyoshi Ando, Atsushi Kaneko, Tsuyoshi Nishimura:
A degree condition for the existence of 1-factors in graphs or their complements. Discret. Math. 203(1-3): 1-8 (1999) - 1997
- [j12]Kiyoshi Ando, Hideo Komuro:
The seven graphs whose H-transformations are uniquely determined. Ars Comb. 46 (1997) - [j11]Kiyoshi Ando, Yoshimi Egawa:
The minimum number of edges in a vertex diameter-2-critical graph. Discret. Math. 167-168: 35-63 (1997) - 1996
- [j10]Kiyoshi Ando, Atsushi Kaneko, Severino Villanueva Gervacio:
The bandwidth of a tree with k leaves is at most. Discret. Math. 150(1-3): 403-406 (1996) - [j9]Kiyoshi Ando, Atsushi Kaneko:
A remark on the connectivity of the complement of a 3-connected graph. Discret. Math. 151(1-3): 39-47 (1996) - 1994
- [j8]Kiyoshi Ando:
An upper bound for orders of certain (k, k_))-connected graphs. Discret. Math. 135(1-3): 371-375 (1994) - 1990
- [j7]Kiyoshi Ando, Severino Villanueva Gervacio, Mikio Kano:
Disjoint subsets of integers having a constant sum. Discret. Math. 82(1): 7-11 (1990)
1980 – 1989
- 1987
- [j6]Kiyoshi Ando, Yoshimi Egawa, Hirobumi Mizuno:
Graphs G for which G and _G are both semidecomposable. Discret. Math. 65(2): 109-114 (1987) - [j5]Kiyoshi Ando, Yoko Usami:
Critically (k, k)-connected graphs. Discret. Math. 66(1-2): 15-20 (1987) - [j4]Kiyoshi Ando, Hikoe Enomoto, Akira Saito:
Contractible edges in 3-connected graphs. J. Comb. Theory B 42(1): 87-93 (1987) - 1986
- [j3]Kiyoshi Ando, Hirobumi Mizuno:
The six bidecomposable graphs. J. Graph Theory 10(1): 117-121 (1986) - 1985
- [j2]Jin Akiyama, Kiyoshi Ando, David Avis:
Eccentric graphs. Discret. Math. 56(1): 1-6 (1985) - [j1]Kiyoshi Ando:
Rao's conjecture on self-complementary graphs with K-factors. J. Graph Theory 9(1): 119-121 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
