|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 59 publication records. Showing 59 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Henning Bruhn, Akira Saito |
Clique or hole in claw-free graphs.  |
J. Comb. Theory, Ser. B  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikio Kano, Akira Saito |
Star-factors with large components. |
Discrete Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Guantao Chen, Katsuhiro Ota, Akira Saito, Yi Zhao |
Hamiltonian cycles with all small even chords. |
Discrete Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Guantao Chen, Yoshimi Egawa, Ronald J. Gould, Akira Saito |
Forbidden pairs for 1-s2.0-S0012365X11004766-si1-connected Hamiltonian graphs. |
Discrete Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jochen Harant, Arnfried Kemnitz, Akira Saito, Ingo Schiermeyer |
Closures, cycles, and paths. |
Journal of Graph Theory |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jun Fujisawa, Shinya Fujita, Michael D. Plummer, Akira Saito, Ingo Schiermeyer |
A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity. |
Combinatorica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jun Fujisawa, Akira Saito, Ingo Schiermeyer |
Closure for spanning trees and distant area. |
Discussiones Mathematicae Graph Theory |
2011 |
DBLP BibTeX RDF |
|
| 1 | 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. |
Journal of Graph Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Katsuhiro Ota, Michael D. Plummer, Akira Saito |
Forbidden triples for perfect matchings. |
Journal of Graph Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert E. L. Aldred, Jun Fujisawa, Akira Saito |
Forbidden subgraphs and the existence of a 2-factor. |
Journal of Graph Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenji Kimura, Masayuki Koyama, Akira Saito |
Small alliances in a weighted graph. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Akira Saito, Yoshihiko Nankaku, Akinobu Lee, Keiichi Tokuda |
Voice activity detection based on conditional random fields using multiple features. |
INTERSPEECH |
2010 |
DBLP BibTeX RDF |
|
| 1 | Akira Saito, Liming Xiong |
Closure, stability and iterated line graphs with a 2-factor. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomoharu Kiyuna, Akira Saito, Elizabeth Kerr, Wendy Bickmore |
Characterization of chromatin texture by contour complexity for cancer cell classification. |
BIBE |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoko Hasegawa, Akira Saito |
Graphs with small boundary. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ralph J. Faudree, Richard H. Schelp, Akira Saito, Ingo Schiermeyer |
Degree conditions for hamiltonicity: Counting the number of missing edges. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Shinya Fujita, Akira Saito, Tomoki Yamashita |
Edge-dominating cycles in graphs. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Guantao Chen, Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito, Ingo Schiermeyer |
Chvátal Erdós condition and 2-factors with a specyfied number of components. |
Discussiones Mathematicae Graph Theory |
2007 |
DBLP BibTeX RDF |
|
| 1 | Akira Saito |
Chvátal-Erdős Theorem: Old Theorem with New Aspects. |
KyotoCGGT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
I. J. Law and Information Technology |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Michael D. Plummer, Akira Saito |
Domination in a graph with a 2-factor. |
Journal of Graph Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dingjun Lou, Akira Saito, Lihua Teng |
A note on internally disjoint alternating paths in bipartite graphs. |
Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito |
A note on 2-factors with two components. |
Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael D. Plummer, Akira Saito |
Forbidden subgraphs and bounds on the size of a maximum matching. |
Journal of Graph Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hikoe Enomoto, Atsushi Kaneko, Akira Saito, Bing Wei |
Long cycles in triangle-free graphs with prescribed independence number and connectivity. |
J. Comb. Theory, Ser. B |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Akira Saito, Tomoki Yamashita |
Cycles within specified distance from each vertex. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Akira Saito |
Toughness, degrees and 2-factors. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Guantao Chen, Hikoe Enomoto, Ken-ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito |
Vertex-disjoint cycles containing specified vertices in a bipartite graph. |
Journal of Graph Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Akira Saito |
Splitting and contractible edges in 4-connected graphs. |
J. Comb. Theory, Ser. B |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Nawarat Ananchuen, Akira Saito |
Factor criticality and complete closure of graphs. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert E. L. Aldred, Derek A. Holton, Dingjun Lou, Akira Saito |
M-alternating paths in n-extendable bipartite graphs. |
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 | Ken-ichi Kawarabayashi, Michael D. Plummer, Akira Saito |
On two equimatchable graph classes. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Akira Saito, Tomoki Yamashita |
A Note on Dominating Cycles in Tough Graphs. |
Ars Comb. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Dingjun Lou, Akira Saito, Lihua Teng |
To Determine 1-Extendable Graphs and its Algorithm. |
Ars Comb. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Guantao Chen, Akira Saito, Bing Wei, Xuerong Zhang |
The hamiltonicity of bipartite graphs involving neighborhood unions. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Zdenek Ryjácek, Akira Saito, Richard H. Schelp |
Claw-free graphs with complete closure. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito |
Hamiltonian cycles in n-factor-critical graphs. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael D. Plummer, Akira Saito |
Closure and factor-critical graphs. |
Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Béla Bollobás, Oliver Riordan, Zdenek Ryjácek, Akira Saito, Richard H. Schelp |
Closure and Hamiltonian-connectivity of claw-free graphs. |
Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Hikoe Enomoto, Michael D. Plummer, Akira Saito |
Neighborhood unions and factor critical graphs. |
Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Tsuyoshi Nishimura, Akira Saito |
Two recursive theorems on n-extendibility. |
Discrete Mathematics |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Akira Saito |
Fan-Type Theorem for Path-Connectivity. |
Combinatorica |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshimi Egawa, Katsuhiro Ota, Akira Saito, Xingxing Yu |
Non-Contractible Edges in A 3-Connected Graph. |
Combinatorica |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Guantao Chen, Akira Saito |
Graphs with a Cycle of Length Divisible by Three. |
J. Comb. Theory, Ser. B |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathaniel Dean, Linda M. Lesniak, Akira Saito |
Cycles of length 0 modulo 4 in graphs. |
Discrete Mathematics |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Akira Saito |
Cycles of length 2 modulo 3 in graphs. |
Discrete Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert E. L. Aldred, Bill Jackson, Dingjun Lou, Akira Saito |
Partitioning regular graphs into equicardinal linear forests. |
Discrete Mathematics |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshimi Egawa, Akira Saito |
Contractible edges in non-separating cycles. |
Combinatorica |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Akira Saito |
One-factors and k-factors. |
Discrete Mathematics |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Akira Saito |
Long cycles through specified vertices in a graph. |
J. Comb. Theory, Ser. B |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshimi Egawa, Hikoe Enomoto, Akira Saito |
Factors and induced subgraphs. |
Discrete Mathematics |
1988 |
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 | Yoshimi Egawa, Hikoe Enomoto, Akira Saito |
On component factors. |
Graphs and Combinatorics |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshimi Egawa, Hikoe Enomoto, Akira Saito |
Contracible edges in triangle-free graphs. |
Combinatorica |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Akira Saito, Songlin Tian |
The binding number of line graphs and total graphs. |
Graphs and Combinatorics |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Hikoe Enomoto, Akira Saito |
Disjoint shortest paths in graphs. |
Combinatorica |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikio Kano, Akira Saito |
[a, b]-factors of graphs. |
Discrete Mathematics |
1983 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #59 of 59 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")