default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAkira Saito
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j112]Michitaka Furuya, Akira Saito, Shoichi Tsuchiya:
Refinements of degree conditions for the existence of a spanning tree without small degree stems. Discret. Math. 348(2): 114307 (2025)- 2024
- [j111]Hiroya Fujinami, Akira Saito
:
A bound on relative lengths of triangle-free graphs. Discret. Math. 347(7): 114010 (2024) - 2023
- [j110]Shingo Degawa, Akira Saito:
A note on secure domination in C5-free graphs. Discret. Appl. Math. 333: 82-83 (2023) - 2022
- [j109]Herman Z. Q. Chen, Sergey Kitaev, Akira Saito:
Representing split graphs by words. Discuss. Math. Graph Theory 42(4): 1263-1280 (2022) - [c18]Akira Saito, Takahiro Aoyagi:
Development of a Synchronous Measurement System for WBAN Channel Modeling Considering Human Body Motion. ISMICT 2022: 1-6 - 2021
- [j108]Hikaru Yokoyama, Atsushi Sasaki, Naotsugu Kaneko, Akira Saito, Kimitaka Nakazawa:
Robust Identification of Motor Unit Discharges From High-Density Surface EMG in Dynamic Muscle Contractions of the Tibialis Anterior. IEEE Access 9: 123901-123911 (2021) - [j107]Qing Cui, Qinghai Liu, Colton Magnant, Akira Saito:
Implications in rainbow forbidden subgraphs. Discret. Math. 344(4): 112267 (2021) - [j106]Jack H. Koolen, Akihiro Munemasa, Atsuhiro Nakamoto, Katsuhiro Ota, Akira Saito:
Preface to the special issue dedicated to Professors Eiichi Bannai and Hikoe Enomoto on their 75th birthdays. Graphs Comb. 37(5): 1465-1466 (2021) - [j105]Robert E. L. Aldred, Jun Fujisawa, Akira Saito:
Distance Matching Extension in Cubic Bipartite Graphs. Graphs Comb. 37(5): 1793-1806 (2021) - [j104]Shuya Chiba, Akira Saito, Masao Tsugaki, Tomoki Yamashita:
Spanning Bipartite Graphs with Large Degree Sum in Graphs of Odd Order. Graphs Comb. 37(5): 1841-1858 (2021) - 2020
- [j103]Guantao Chen, Shuya Chiba, Ronald J. Gould, Xiaofeng Gu, Akira Saito, Masao Tsugaki, Tomoki Yamashita:
Spanning bipartite graphs with high degree sum in graphs. Discret. Math. 343(2): 111663 (2020) - [j102]Sergey Kitaev, Akira Saito:
On semi-transitive orientability of Kneser graphs and their complements. Discret. Math. 343(8): 111909 (2020) - [j101]Robert E. L. Aldred, Jun Fujisawa, Akira Saito:
Distance matching extension and local structure of graphs. J. Graph Theory 93(1): 5-20 (2020) - [j100]Henry Liu, Colton Magnant, Akira Saito, Ingo Schiermeyer, Yongtang Shi:
Gallai-Ramsey number for K 4. J. Graph Theory 94(2): 192-205 (2020)
2010 – 2019
- 2019
- [j99]Ryuta Sato, Kiichi Morishita, Isamu Nishida, Keiichi Shirase, Masanobu Hasegawa, Akira Saito, Takayuki Iwasaki:
Improvement of Simultaneous 5-Axis Controlled Machining Accuracy by CL-Data Modification. Int. J. Autom. Technol. 13(5): 583-592 (2019) - [j98]Robert E. L. Aldred, Jun Fujisawa, Akira Saito:
Pairs and triples of forbidden subgraphs and the existence of a 2-factor. J. Graph Theory 90(1): 61-82 (2019) - 2018
- [j97]Victor Andrew A. Antonio, Naoaki Ono, Akira Saito, Tetsuo Sato, Md. Altaf-Ul-Amin, Shigehiko Kanaya:
Classification of lung adenocarcinoma transcriptome subtypes from pathological images using deep convolutional networks. Int. J. Comput. Assist. Radiol. Surg. 13(12): 1905-1913 (2018) - [j96]Guantao Chen, Ronald J. Gould, Xiaofeng Gu, Akira Saito:
Cycles with a chord in dense graphs. Discret. Math. 341(8): 2131-2141 (2018) - [j95]Ryuta Sato, Shogo Hasegawa, Keiichi Shirase, Masanobu Hasegawa, Akira Saito, Takayuki Iwasaki:
Motion Accuracy Enhancement of Five-Axis Machine Tools by Modified CL-Data. Int. J. Autom. Technol. 12(5): 699-706 (2018) - 2017
- [j94]Michael D. Plummer, Akira Saito:
Toughness, binding number and restricted matching extension in a graph. Discret. Math. 340(11): 2665-2672 (2017) - [j93]Robert E. L. Aldred, Jun Fujisawa, Akira Saito:
Edge proximity and matching extension in punctured planar triangulations. Discret. Math. 340(12): 2978-2985 (2017) - [j92]Guantao Chen, Mark N. Ellingham, Akira Saito, Songling Shan:
Spanning Trails with Maximum Degree at Most 4 in 2K2 -Free Graphs. Graphs Comb. 33(5): 1095-1101 (2017) - 2016
- [j91]Nawarat Ananchuen, Watcharaphong Ananchuen, Akira Saito:
Extendability of the complementary prism of bipartite graphs. Australas. J Comb. 66: 436-448 (2016) - [j90]Akira Saito, Kazuki Sano:
Spanning trees homeomorphic to a small tree. Discret. Math. 339(2): 677-681 (2016) - [j89]Akira Saito, Liming Xiong:
The Ryjáček closure and a forbidden subgraph. Discuss. Math. Graph Theory 36(3): 621-628 (2016) - [j88]Nelson Kibinge, Naoaki Ono, Masafumi Horie, Tetsuo Sato, Tadao Sugiura, Md. Altaf-Ul-Amin, Akira Saito, Shigehiko Kanaya:
Integrated pathway-based transcription regulation network mining and visualization based on gene expression profiles. J. Biomed. Informatics 61: 194-202 (2016) - [j87]Takeshi Mitsunaka, Daiki Sato, Nobuyuki Ashida, Akira Saito, Kunihiko Iizuka, Tetsuhito Suzuki, Yuichi Ogawa, Minoru Fujishima:
CMOS Biosensor IC Focusing on Dielectric Relaxations of Biological Water With 120 and 60 GHz Oscillator Arrays. IEEE J. Solid State Circuits 51(11): 2534-2544 (2016) - [c17]Motohiro Tanabe, Akira Saito, Masahiro Umehira, Shigeki Takeda:
A novel overlap FFT filter-bank using windowing and smoothing techniques to reduce adjacent channel interference for flexible spectrum access. ICTC 2016: 115-120 - [c16]Takeshi Mitsunaka, Nobuyuki Ashida, Akira Saito, Kunihiko Iizuka, Tetsuhito Suzuki, Yuichi Ogawa, Minoru Fujishima:
28.3 CMOS biosensor IC focusing on dielectric relaxations of biological water with 120GHz and 60GHz oscillator arrays. ISSCC 2016: 478-479 - 2015
- [j86]Yoshimi Egawa, Jun Fujisawa, Michitaka Furuya, Michael D. Plummer, Akira Saito:
Forbidden Triples Generating a Finite set of 3-Connected Graphs. Electron. J. Comb. 22(3): 3 (2015) - [j85]Yoshimi Egawa, Jun Fujisawa, Michael D. Plummer, Akira Saito, Tomoki Yamashita:
Perfect matchings avoiding prescribed edges in a star-free graph. Discret. Math. 338(12): 2260-2274 (2015) - [j84]Atsuhiro Nakamoto, Katsuhiro Ota, Akira Saito:
Preface. Graphs Comb. 31(6): 1819-1820 (2015) - [c15]Akira Saito, Megumi Nakao, Yuki Uranishi, Tetsuya Matsuda:
Deformation Estimation of Elastic Bodies Using Multiple Silhouette Images for Endoscopic Image Augmentation. ISMAR 2015: 170-171 - 2014
- [j83]Chihoko Ojima, Akira Saito, Kazuki Sano:
Precoloring extension involving pairs of vertices of small distance. Discret. Appl. Math. 166: 170-177 (2014) - [j82]Michael D. Plummer, Akira Saito:
A note on graphs contraction-critical with respect to independence number. Discret. Math. 325: 85-91 (2014) - [j81]Shunta Iguchi, Akira Saito, Kazunori Watanabe, Takayasu Sakurai, Makoto Takamiya:
Design Method of Class-F Power Amplifier With Output Power of -20 dBm and Efficient Dual Supply Voltage Transmitter. IEEE Trans. Circuits Syst. I Regul. Pap. 61-I(10): 2978-2986 (2014) - [c14]Yuri Murakami, Tokiya Abe, Yoshiko Yamashita, Masahiro Yamaguchi, Masahiro Ishikawa, Akinori Hashiguchi, Tomoharu Kiyuna, Akira Saito, Michiie Sakamoto:
Color processing in pathology image analysis system for liver biopsy. CIC 2014: 184-188 - 2013
- [j80]Jun Fujisawa, Michael D. Plummer, Akira Saito:
Forbidden subgraphs generating a finite set. Discret. Math. 313(19): 1835-1842 (2013) - [j79]Guantao Chen, Akira Saito, Songling Shan:
The Existence of a 2-Factor in a Graph Satisfying the Local Chvátal-Erdös Condition. SIAM J. Discret. Math. 27(4): 1788-1799 (2013) - [c13]Shunta Iguchi, Akira Saito, Kentaro Honda, Yun Fei Zheng, Kazunori Watanabe, Takayasu Sakurai, Makoto Takamiya:
315MHz OOK transceiver with 38-µW receiver and 36-µW transmitter in 40-nm CMOS. ASP-DAC 2013: 93-94 - [c12]Tomoharu Kiyuna, Akira Saito, Atsushi Marugame, Yoshiko Yamashita, Maki Ogura, Eric Cosatto, Tokiya Abe, Akinori Hashiguchi, Michiie Sakamoto:
Automatic classification of hepatocellular carcinoma images based on nuclear and structural features. Medical Imaging: Digital Pathology 2013: 86760Y - [c11]Akira Saito, Eric Cosatto, Tomoharu Kiyuna, Michiie Sakamoto:
Dawn of the digital diagnosis assisting system, can it open a new age for pathology? Medical Imaging: Digital Pathology 2013: 867602 - [c10]Eric Cosatto, Pierre-François Laquerre, Christopher Malon, Hans Peter Graf, Akira Saito, Tomoharu Kiyuna, Atsushi Marugame, Ken'ichi Kamijo:
Automated gastric cancer diagnosis on H&E-stained sections; ltraining a classifier on a large scale with multiple instance machine learning. Medical Imaging: Digital Pathology 2013: 867605 - 2012
- [j78]Mikio Kano, Aung Kyaw, Haruhide Matsuda, Kenta Ozeki, Akira Saito, Tomoki Yamashita:
Spanning trees with a bounded number of leaves in a claw-free graph. Ars Comb. 103: 137-154 (2012) - [j77]Jun Fujisawa, Akira Saito:
A Pair of Forbidden Subgraphs and 2-Factors. Comb. Probab. Comput. 21(1-2): 149-158 (2012) - [j76]Guantao Chen, Yoshimi Egawa, Ronald J. Gould, Akira Saito:
Forbidden pairs for 1-s2.0-S0012365X11004766-si1-connected Hamiltonian graphs. Discret. Math. 312(5): 938-942 (2012) - [j75]Guantao Chen, Katsuhiro Ota, Akira Saito, Yi Zhao:
Hamiltonian cycles with all small even chords. Discret. Math. 312(6): 1226-1240 (2012) - [j74]Mikio Kano, Akira Saito:
Star-factors with large components. Discret. Math. 312(12-13): 2005-2008 (2012) - [j73]Henning Bruhn, Akira Saito:
Clique or hole in claw-free graphs. J. Comb. Theory B 102(1): 1-13 (2012) - [j72]Jochen Harant, Arnfried Kemnitz, Akira Saito, Ingo Schiermeyer:
Closures, cycles, and paths. J. Graph Theory 69(3): 314-323 (2012) - [c9]Shunta Iguchi, Akira Saito, Kazunori Watanabe, Takayasu Sakurai, Makoto Takamiya:
2.1 Times increase of drain efficiency by dual supply voltage scheme in 315MHz class-F Power amplifier at output power of -20dBm. ESSCIRC 2012: 345-348 - [c8]Yuri Murakami, Hikaru Gunji, Fumikazu Kimura, Masahiro Yamaguchi, Yoshiko Yamashita, Akira Saito, Tokiya Abe, Michiie Sakamoto, Pinky A. Bautista, Yukako Yagi:
Color Correction in Whole Slide Digital Pathology. CIC 2012: 253-258 - [c7]Akira Saito, Yun Fei Zheng, Kazunori Watanabe, Takayasu Sakurai, Makoto Takamiya:
0.35V, 4.1μW, 39MHz crystal oscillator in 40nm CMOS. ISLPED 2012: 333-338 - [c6]Akira Saito, Kentaro Honda, Yun Fei Zheng, Shunta Iguchi, Kazunori Watanabe, Takayasu Sakurai, Makoto Takamiya:
An all 0.5V, 1Mbps, 315MHz OOK transceiver with 38-µW career-frequency-free intermittent sampling receiver and 52-µW class-F transmitter in 40-nm CMOS. VLSIC 2012: 38-39 - 2011
- [j71]Jun Fujisawa, Shinya Fujita, Michael D. Plummer, Akira Saito, Ingo Schiermeyer:
A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity. Comb. 31(6): 703-723 (2011) - [j70]Jun Fujisawa, Akira Saito, Ingo Schiermeyer:
Closure for spanning trees and distant area. Discuss. Math. Graph Theory 31(1): 143-159 (2011) - [j69]Tohru Onozaki, Akira Saito, Masashi Yoritsune:
Simulation of Cylindrical Plunge Grinding Processes Considered Successive Change of Workpiece Shape. Int. J. Autom. Technol. 5(3): 433-438 (2011) - [j68]Katsuhiro Ota, Michael D. Plummer, Akira Saito:
Forbidden triples for perfect matchings. J. Graph Theory 67(3): 250-259 (2011) - [j67]Robert E. L. Aldred, Yoshimi Egawa, Jun Fujisawa, Katsuhiro Ota, Akira Saito:
The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity. J. Graph Theory 68(1): 77-89 (2011) - 2010
- [j66]Kenji Kimura, Masayuki Koyama, Akira Saito:
Small alliances in a weighted graph. Discret. Appl. Math. 158(18): 2071-2074 (2010) - [j65]Robert E. L. Aldred, Jun Fujisawa, Akira Saito:
Forbidden subgraphs and the existence of a 2-factor. J. Graph Theory 64(3): 250-266 (2010) - [c5]Akira Saito, Yoshihiko Nankaku, Akinobu Lee, Keiichi Tokuda:
Voice activity detection based on conditional random fields using multiple features. INTERSPEECH 2010: 2086-2089
2000 – 2009
- 2009
- [j64]Robert E. L. Aldred, Jun Fujisawa, Akira Saito:
Two forbidden subgraphs and the existence of a 2-factor in graphs. Australas. J Comb. 44: 235-246 (2009) - [j63]Akira Saito, Liming Xiong:
Closure, stability and iterated line graphs with a 2-factor. Discret. Math. 309(16): 5000-5010 (2009) - 2008
- [j62]Jun Fujisawa, Adriana Hansberg, Takahiro Kubo, Akira Saito, Masahide Sugita, Lutz Volkmann:
A note on the 2-domination number of a tree. Australas. J Comb. 40: 265-268 (2008) - [c4]Tomoharu Kiyuna, Akira Saito, Elizabeth Kerr, Wendy A. Bickmore:
Characterization of chromatin texture by contour complexity for cancer cell classification. BIBE 2008: 1-6 - 2007
- [j61]Ralph J. Faudree, Richard H. Schelp, Akira Saito, Ingo Schiermeyer:
Degree conditions for hamiltonicity: Counting the number of missing edges. Discret. Math. 307(7-8): 873-877 (2007) - [j60]Yoko Hasegawa, Akira Saito:
Graphs with small boundary. Discret. Math. 307(14): 1801-1807 (2007) - [j59]Shinya Fujita, Akira Saito, Tomoki Yamashita:
Edge-dominating cycles in graphs. Discret. Math. 307(23): 2934-2942 (2007) - [j58]Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito, Ingo Schiermeyer:
Chvátal Erdós condition and 2-factors with a specyfied number of components. Discuss. Math. Graph Theory 27(3): 401-407 (2007) - [j57]Sheng Bau, Akira Saito:
Reduction for 3-Connected Graphs of Minimum Degree at Least Four. Graphs Comb. 23(Supplement-1): 135-144 (2007) - [c3]Takae Sakai, Shinya Ito, Nobuyoshi Kaiki, Atsushi Sakai, Mamoru Okazaki, Masayuki Natsumi, Akira Saito, Kazumasa Kioi, Masato Koutani, Koutani Kagoshima, Shuichi Kawama, Hiroshi Kijima, Shinji Toyoyama, Nobutoshi Matsunaga, Mutsumi Hamaguchi, Hiroshi Kawamura, Kunihiko Iizuka:
A Digital TV Receiver RF and BB Chipset with Adaptive Bias-Current Control for Mobile Applications. ISSCC 2007: 212-597 - [c2]Akira Saito:
Chvátal-Erdős Theorem: Old Theorem with New Aspects. KyotoCGGT 2007: 191-200 - 2006
- [j56]Akira Saito:
Contractible edges and removable edges in a graph with large minimum degree. Australas. J Comb. 35: 313-318 (2006) - [j55]Akira Saito:
Sorting Out Deregulation: Protecting Free Speech and Internet Access in The United States, Germany, and Japan by Kim, Jae-Young, (LFB Scholarly Publishing LLC, 2002), pp 196. Int. J. Law Inf. Technol. 14(2): 254-255 (2006) - [j54]Shinya Fujita, Ken-ichi Kawarabayashi, Cláudio Leonardo Lucchesi, Katsuhiro Ota, Michael D. Plummer, Akira Saito:
A pair of forbidden subgraphs and perfect matchings. J. Comb. Theory B 96(3): 315-324 (2006) - [j53]Ken-ichi Kawarabayashi, Michael D. Plummer, Akira Saito:
Domination in a graph with a 2-factor. J. Graph Theory 52(1): 1-6 (2006) - 2005
- [j52]Dingjun Lou, Akira Saito, Lihua Teng:
A note on internally disjoint alternating paths in bipartite graphs. Discret. Math. 290(1): 105-108 (2005) - [j51]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito:
A note on 2-factors with two components. Discret. Math. 300(1-3): 218-224 (2005) - [j50]Michael D. Plummer, Akira Saito:
Forbidden subgraphs and bounds on the size of a maximum matching. J. Graph Theory 50(1): 1-12 (2005) - 2004
- [j49]Akira Saito, Tomoki Yamashita:
Cycles within specified distance from each vertex. Discret. Math. 278(1-3): 219-226 (2004) - [j48]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito:
Toughness, degrees and 2-factors. Discret. Math. 286(3): 245-249 (2004) - [j47]Hikoe Enomoto, Atsushi Kaneko, Akira Saito, Bing Wei:
Long cycles in triangle-free graphs with prescribed independence number and connectivity. J. Comb. Theory B 91(1): 43-55 (2004) - [j46]Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito:
Vertex-disjoint cycles containing specified vertices in a bipartite graph. J. Graph Theory 46(3): 145-166 (2004) - [c1]Yosuke Nakagawa, Akira Saito, Takashi Maeno:
Transient analysis of bar-type ultrasonic motors. IROS 2004: 1263-1268 - 2003
- [j45]Dingjun Lou, Akira Saito, Lihua Teng:
To Determine 1-Extendable Graphs and its Algorithm. Ars Comb. 69 (2003) - [j44]Akira Saito, Tomoki Yamashita:
A Note on Dominating Cycles in Tough Graphs. Ars Comb. 69 (2003) - [j43]Nawarat Ananchuen, Akira Saito:
Factor criticality and complete closure of graphs. Discret. Math. 265(1-3): 13-21 (2003) - [j42]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) - [j41]Ken-ichi Kawarabayashi, Michael D. Plummer, Akira Saito:
On two equimatchable graph classes. Discret. Math. 266(1-3): 263-274 (2003) - [j40]Robert E. L. Aldred, Derek A. Holton, Dingjun Lou, Akira Saito:
M-alternating paths in n-extendable bipartite graphs. Discret. Math. 269(1-3): 1-11 (2003) - [j39]Akira Saito:
Splitting and contractible edges in 4-connected graphs. J. Comb. Theory B 88(2): 227-235 (2003) - [j38]Ralph J. Faudree, Ronald J. Gould, Alexandr V. Kostochka, Linda M. Lesniak, Ingo Schiermeyer, Akira Saito:
Degree conditions for k-ordered hamiltonian graphs. J. Graph Theory 42(3): 199-210 (2003) - 2002
- [j37]Guantao Chen, Akira Saito, Bing Wei, Xuerong Zhang:
The hamiltonicity of bipartite graphs involving neighborhood unions. Discret. Math. 249(1-3): 45-56 (2002) - [j36]Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito:
Hamiltonian cycles in n-extendable graphs. J. Graph Theory 40(2): 75-82 (2002) - 2001
- [j35]Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito:
Vertex-disjoint cycles containing specified edges in a bipartite graph. Australas. J Comb. 23: 37-48 (2001) - [j34]Zdenek Ryjácek, Akira Saito, Richard H. Schelp:
Claw-free graphs with complete closure. Discret. Math. 236(1-3): 325-338 (2001) - [j33]Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito:
Hamiltonian cycles in n-factor-critical graphs. Discret. Math. 240(1-3): 71-82 (2001) - [j32]Rao Li, Akira Saito, Richard H. Schelp:
Relative length of longest paths and cycles in 3-connected graphs. J. Graph Theory 37(3): 137-156 (2001) - 2000
- [j31]Michael D. Plummer, Akira Saito:
Closure and factor-critical graphs. Discret. Math. 215: 171-179 (2000) - [j30]Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Akira Saito:
2-factors in claw-free graphs. Discuss. Math. Graph Theory 20(2): 165-172 (2000)
1990 – 1999
- 1999
- [j29]Béla Bollobás, Oliver Riordan, Zdenek Ryjácek, Akira Saito, Richard H. Schelp:
Closure and Hamiltonian-connectivity of claw-free graphs. Discret. Math. 195(1-3): 67-80 (1999) - [j28]Hikoe Enomoto, Michael D. Plummer, Akira Saito:
Neighborhood unions and factor critical graphs. Discret. Math. 205(1-3): 217-220 (1999) - [j27]Akira Saito:
Long paths, long cycles, and their relative length. J. Graph Theory 30(2): 91-99 (1999) - [j26]Akira Saito:
Degree sums and graphs that are not covered by two cycles. J. Graph Theory 32(1): 51-61 (1999) - [j25]Zdenek Ryjácek, Akira Saito, Richard H. Schelp:
Closure, 2-factors, and cycle coverings in claw-free graphs. J. Graph Theory 32(2): 109-117 (1999) - 1996
- [j24]Akira Saito:
Fan-Type Theorem for Path-Connectivity. Comb. 16(3): 433-437 (1996) - [j23]Tsuyoshi Nishimura, Akira Saito:
Two recursive theorems on n-extendibility. Discret. Math. 162(1-3): 319-323 (1996) - [j22]Guantao Chen, Yoshimi Egawa, Xin Liu, Akira Saito:
Essential independent sets and Hamiltonian cycles. J. Graph Theory 21(2): 243-249 (1996) - 1995
- [j21]Yoshimi Egawa, Katsuhiro Ota, Akira Saito, Xingxing Yu:
Non-Contractible Edges in A 3-Connected Graph. Comb. 15(3): 357-364 (1995) - [j20]Hikoe Enomoto, Jan van den Heuvel, Atsushi Kaneko, Akira Saito:
Relative length of long paths and cycles in graphs with large degree sums. J. Graph Theory 20(2): 213-225 (1995) - 1994
- [j19]Guantao Chen, Akira Saito:
Graphs with a Cycle of Length Divisible by Three. J. Comb. Theory B 60(2): 277-292 (1994) - 1993
- [j18]Nathaniel Dean, Linda M. Lesniak, Akira Saito:
Cycles of length 0 modulo 4 in graphs. Discret. Math. 121(1-3): 37-49 (1993) - 1992
- [j17]Akira Saito:
Cycles of length 2 modulo 3 in graphs. Discret. Math. 101(1-3): 285-289 (1992) - 1991
- [j16]Yoshimi Egawa, Akira Saito:
Contractible edges in non-separating cycles. Comb. 11(4): 389-392 (1991) - [j15]Robert E. L. Aldred, Bill Jackson, Dingjun Lou, Akira Saito:
Partitioning regular graphs into equicardinal linear forests. Discret. Math. 88(1): 1-9 (1991) - [j14]Atsushi Kaneko, Akira Saito:
Cycles intersecting a prescribed vertex set. J. Graph Theory 15(6): 655-664 (1991) - 1990
- [j13]Akira Saito:
One-factors and k-factors. Discret. Math. 91(3): 323-326 (1990) - [j12]Derek A. Holton, Bill Jackson, Akira Saito, Nicholas C. Wormald:
Removable edges in 3-connected graphs. J. Graph Theory 14(4): 465-473 (1990) - [j11]Akira Saito:
Covering contractible edges in 3-connected graphs. I: Covers of size three are cutsets. J. Graph Theory 14(6): 635-643 (1990)
1980 – 1989
- 1989
- [j10]Akira Saito:
Long cycles through specified vertices in a graph. J. Comb. Theory B 47(2): 220-230 (1989) - 1988
- [j9]Yoshimi Egawa, Hikoe Enomoto, Akira Saito:
Factors and induced subgraphs. Discret. Math. 68(2-3): 179-189 (1988) - 1987
- [j8]Kiyoshi Ando, Hikoe Enomoto, Akira Saito:
Contractible edges in 3-connected graphs. J. Comb. Theory B 42(1): 87-93 (1987) - 1986
- [j7]Yoshimi Egawa, Hikoe Enomoto, Akira Saito:
Contracible edges in triangle-free graphs. Comb. 6(3): 269-274 (1986) - [j6]Yoshimi Egawa, Hikoe Enomoto, Akira Saito:
On component factors. Graphs Comb. 2(1): 223-225 (1986) - 1985
- [j5]Akira Saito, Songlin Tian:
The binding number of line graphs and total graphs. Graphs Comb. 1(1): 351-356 (1985) - [j4]Hikoe Enomoto, Bill Jackson, P. Katerinis, Akira Saito:
Toughness and the existence of k-factors. J. Graph Theory 9(1): 87-95 (1985) - [j3]Béla Bollobás, Akira Saito, Nicholas C. Wormald:
Regular factors of regular graphs. J. Graph Theory 9(1): 97-103 (1985) - 1984
- [j2]Hikoe Enomoto, Akira Saito:
Disjoint shortest paths in graphs. Comb. 4(4): 275-279 (1984) - 1983
- [j1]Mikio Kano, Akira Saito:
[a, b]-factors of graphs. Discret. Math. 47: 113-116 (1983)
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-11-13 23:49 CET 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:
