Kiyoshi Ando - RankMe

59 papers Journal 58Unranked 1

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A constructive characterization of 4-connected 4-regular graphs. Discret. Math. Kiyoshi Ando, Yoshimi Egawa
2025	J	`jnl`	A constructive characterization of $5$-connected graphs. Australas. J Comb. Kiyoshi Ando, Yoshimi Egawa
2023	J	`jnl`	Properly 3-contractible edges in a minimally 3-connected graph. Discret. Math. Kiyoshi Ando, Yoshimi Egawa
2022	J	`jnl`	A Constructive Characterization of 4-Connected Graphs. Graphs Comb. Kiyoshi Ando
2022	J	`jnl`	Contractible edges and liftable vertices in a 4-connected graph. Discret. Math. Kiyoshi Ando
2021	J	`jnl`	Contractible Edges and Contractible Triangles in a 3-Connected Graph. Graphs Comb. Kiyoshi Ando, Yoshimi Egawa
2021	J	`jnl`	Contractible edges in Discret. Math. Kiyoshi Ando
2020	J	`jnl`	A new forbidden subgraph for 5-contractible edges. Discret. Math. Kiyoshi Ando
2019	J	`jnl`	A constructive characterization of contraction critical 8-connected graphs with minimum degree 9. Discret. Math. Chengfu Qin, Weihua He, Kiyoshi Ando
2019	J	`jnl`	A local condition for k-contractible edges. Discret. Math. Kiyoshi Ando
2018	J	`jnl`	A new forbidden pair for 6-contractible edges. Discret. Math. Kiyoshi Ando
2017	J	`jnl`	Small Components of the 5-Subgraph of a Contraction-critically 5-Connected Graph. Graphs Comb. Kiyoshi Ando
2016	J	`jnl`	Some degree and forbidden subgraph conditions for a graph to have a k-contractible edge. Discret. Math. Kiyoshi Ando
2015	J	`jnl`	The Removable Edges and the Contractible Subgraphs of 5-Connected Graphs. Graphs Comb. Chengfu Qin, Xiaofeng Guo, Kiyoshi Ando
2014	J	`jnl`	The Average Degree of Minimally Contraction-Critically 5-Connected Graphs. J. Graph Theory Kiyoshi Ando, Yoshimi Egawa, Matthias Kriesell
2012	J	`jnl`	Minimally contraction-critically 6-connected graphs. Discret. Math. Kiyoshi Ando, Shinya Fujita, Ken-ichi Kawarabayashi
2011	J	`jnl`	Some structural properties of minimally contraction-critically 5-connected graphs. Discret. Math. Kiyoshi Ando, Chengfu Qin
2011	J	`jnl`	The number of vertices of degree 5 in a contraction-critically 5-connected graph. Discret. Math. Kiyoshi Ando, Takashi Iwase
2009	J	`jnl`	A local structure theorem on 5-connected graphs. J. Graph Theory Kiyoshi Ando
2009	J	`jnl`	On the number of 4-contractible edges in 4-connected graphs. J. Comb. Theory B Kiyoshi Ando, Yoshimi Egawa, Ken-ichi Kawarabayashi, Matthias Kriesell
2009	J	`jnl`	Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph. Discret. Math. Kiyoshi Ando
2008	J	`jnl`	Contractible edges in minimally k-connected graphs. Discret. Math. Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
2008	J	`jnl`	Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph. Discret. Math. Kiyoshi Ando, Yoshimi Egawa
2008	J	`jnl`	Edges not contained in triangles and the number of contractible edges in a 4-connected graph. Discret. Math. Kiyoshi Ando, Yoshimi Egawa
2007	J	`jnl`	Contractible Edges in a 4-Connected Graph with Vertices of Degree Greater Than Four. Graphs Comb. Kiyoshi Ando, Yoshimi Egawa
2006	J	`jnl`	Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph. Electron. Notes Discret. Math. Kiyoshi Ando
2006	J	`jnl`	Tight quadrangulations on the sphere. Discret. Math. Hideo Komuro, Kiyoshi Ando, Atsuhiro Nakamoto
2005	—	`conf`	Contractible Edges in a CJCDGCGT Kiyoshi Ando
2005	J	`jnl`	Trivially noncontractible edges in a contraction critically 5-connected graph. Discret. Math. Kiyoshi Ando
2005	J	`jnl`	Vertices of Degree 5 in a Contraction Critically 5-connected Graph. Graphs Comb. Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
2003	J	`jnl`	Cycles having the same modularity and removable edges in 2-connected graphs. Discret. Math. Kiyoshi Ando, Mariko Hagita, Atsushi Kaneko, Mikio Kano, Ken-ichi Kawarabayashi, Akira Saito
2003	J	`jnl`	Maximum number of edges in a critically Discret. Math. Kiyoshi Ando, Yoshimi Egawa
2003	J	`jnl`	Some forbidden subgraph conditions for a graph to have a Discret. Math. Kiyoshi Ando, Ken-ichi Kawarabayashi
2003	J	`jnl`	Vertices of degree 6 in a contraction critically 6-connected graph. Discret. Math. Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
2002	J	`jnl`	Bandwidth of the cartesian product of two connected graphs. Discret. Math. Toru Kojima, Kiyoshi Ando
2002	J	`jnl`	Contractible Edges and Bowties in a k-Connected Graph. Ars Comb. Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi, Kiyoshi Yoshiomoto
2002	J	`jnl`	Contractible edges in minimally k-connected graphs. Electron. Notes Discret. Math. Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
2002	J	`jnl`	Graphs G for which both G and G Graphs Comb. Jin Akiyama, Kiyoshi Ando, Yoshimi Egawa
2002	J	`jnl`	On Quadrangulations of Closed Surfaces Covered by Vertices of Degree 3. Ars Comb. Kiyoshi Ando, Atsuhiro Nakamoto
2002	J	`jnl`	Path factors in claw-free graphs. Discret. Math. Kiyoshi Ando, Yoshimi Egawa, Atsushi Kaneko, Ken-ichi Kawarabayashi, Haruhide Matsuda
2002	J	`jnl`	Self-complementary Graphs with Minimum Degree Two. Ars Comb. Kiyoshi Ando, Atsuhiro Nakamoto
2001	J	`jnl`	Diagonal flips of pseudo triangulations on the sphere. Ars Comb. Hideo Komuro, Kiyoshi Ando
2001	J	`jnl`	Minimum length of cycles through specified vertices in graphs with wide-diameter at most d. Ars Comb. Toru Kojima, Kiyoshi Ando
2001	J	`jnl`	Vertices of degree 6 in a 6-contraction critical graph. Electron. Notes Discret. Math. Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi
2000	J	`jnl`	Contractible edges in a k-connected graph (K Electron. Notes Discret. Math. Kiyoshi Ando
2000	J	`jnl`	Wide-diameter and minimum length of fan. Theor. Comput. Sci. Toru Kojima, Kiyoshi Ando
1999	J	`jnl`	A degree condition for the existence of 1-factors in graphs or their complements. Discret. Math. Kiyoshi Ando, Atsushi Kaneko, Tsuyoshi Nishimura
1997	J	`jnl`	The minimum number of edges in a vertex diameter-2-critical graph. Discret. Math. Kiyoshi Ando, Yoshimi Egawa
1997	J	`jnl`	The seven graphs whose H-transformations are uniquely determined. Ars Comb. Kiyoshi Ando, Hideo Komuro
1996	J	`jnl`	A remark on the connectivity of the complement of a 3-connected graph. Discret. Math. Kiyoshi Ando, Atsushi Kaneko
1996	J	`jnl`	The bandwidth of a tree with k leaves is at most. Discret. Math. Kiyoshi Ando, Atsushi Kaneko, Severino Villanueva Gervacio
1994	J	`jnl`	An upper bound for orders of certain (k, k Discret. Math. Kiyoshi Ando
1990	J	`jnl`	Disjoint subsets of integers having a constant sum. Discret. Math. Kiyoshi Ando, Severino Villanueva Gervacio, Mikio Kano
1987	J	`jnl`	Contractible edges in 3-connected graphs. J. Comb. Theory B Kiyoshi Ando, Hikoe Enomoto, Akira Saito
1987	J	`jnl`	Critically (k, k)-connected graphs. Discret. Math. Kiyoshi Ando, Yoko Usami
1987	J	`jnl`	Graphs G for which G and _G are both semidecomposable. Discret. Math. Kiyoshi Ando, Yoshimi Egawa, Hirobumi Mizuno
1986	J	`jnl`	The six bidecomposable graphs. J. Graph Theory Kiyoshi Ando, Hirobumi Mizuno
1985	J	`jnl`	Eccentric graphs. Discret. Math. Jin Akiyama, Kiyoshi Ando, David Avis
1985	J	`jnl`	Rao's conjecture on self-complementary graphs with J. Graph Theory Kiyoshi Ando