Akira Saito

From MaRDI portal
(Redirected from Person:214981)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Refinements of degree conditions for the existence of a spanning tree without small degree stems
Discrete Mathematics
2024-12-02Paper
On 2-factors with a specified number of components in line graphs
Acta Mathematica Universitatis Comenianae. New Series
2024-10-18Paper
A bound on relative lengths of triangle-free graphs
Discrete Mathematics
2024-05-21Paper
A note on secure domination in \(C_5\)-free graphs
Discrete Applied Mathematics
2023-04-27Paper
Representing split graphs by words
Discussiones Mathematicae Graph Theory
2022-07-26Paper
Distance matching extension in cubic bipartite graphs
Graphs and Combinatorics
2021-11-25Paper
Spanning bipartite graphs with large degree sum in graphs of odd order
Graphs and Combinatorics
2021-11-25Paper
Implications in rainbow forbidden subgraphs
Discrete Mathematics
2021-03-25Paper
On semi-transitive orientability of Kneser graphs and their complements
Discrete Mathematics
2020-06-08Paper
Distance matching extension and local structure of graphs
Journal of Graph Theory
2020-05-21Paper
Spanning bipartite graphs with high degree sum in graphs
Discrete Mathematics
2019-12-17Paper
Pairs and triples of forbidden subgraphs and the existence of a 2-factor
Journal of Graph Theory
2019-06-14Paper
Cycles with a chord in dense graphs
Discrete Mathematics
2018-06-07Paper
Spanning trails with maximum degree at most 4 in \(2K_2\)-free graphs
Graphs and Combinatorics
2017-12-12Paper
Extendability of the complementary prism of bipartite graphs2017-11-17Paper
Edge proximity and matching extension in punctured planar triangulations
Discrete Mathematics
2017-09-18Paper
Toughness, binding number and restricted matching extension in a graph
Discrete Mathematics
2017-09-05Paper
The Ryjáček closure and a forbidden subgraph
Discussiones Mathematicae Graph Theory
2016-07-13Paper
Ralph Faudree (1938--2015)
Discrete Mathematics
2016-04-27Paper
Spanning trees homeomorphic to a small tree
Discrete Mathematics
2015-12-08Paper
Forbidden triples generating a finite set of 3-connected graphs
The Electronic Journal of Combinatorics
2015-08-27Paper
Perfect matchings avoiding prescribed edges in a star-free graph
Discrete Mathematics
2015-08-05Paper
A note on graphs contraction-critical with respect to independence number
Discrete Mathematics
2014-05-06Paper
The existence of a 2-factor in a graph satisfying the local Chvátal-Erdős condition
SIAM Journal on Discrete Mathematics
2014-04-10Paper
Precoloring extension involving pairs of vertices of small distance
Discrete Applied Mathematics
2014-02-18Paper
Forbidden subgraphs generating a finite set
Discrete Mathematics
2013-12-06Paper
Spanning trees with a bounded number of leaves in a claw-free graph.2012-12-19Paper
Star-factors with large components
Discrete Mathematics
2012-06-18Paper
Closures, cycles, and paths
Journal of Graph Theory
2012-06-13Paper
A pair of forbidden subgraphs and 2-factors
Combinatorics, Probability and Computing
2012-05-14Paper
A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity
Combinatorica
2012-04-26Paper
Hamiltonian cycles with all small even chords
Discrete Mathematics
2012-04-13Paper
Clique or hole in claw-free graphs
Journal of Combinatorial Theory. Series B
2012-03-19Paper
Forbidden pairs for \(k\)-connected Hamiltonian graphs
Discrete Mathematics
2012-03-16Paper
The existence of a 2-factor in \(K_{1,n}\)-free graphs with large connectivity and large edge-connectivity
Journal of Graph Theory
2011-10-12Paper
Closure for spanning trees and distant area
Discussiones Mathematicae Graph Theory
2011-10-05Paper
Forbidden triples for perfect matchings
Journal of Graph Theory
2011-07-21Paper
List coloring of graphs with cycles of length divisible by a given integer2011-05-31Paper
Small alliances in a weighted graph
Discrete Applied Mathematics
2010-11-25Paper
Forbidden subgraphs and the existence of a 2-factor
Journal of Graph Theory
2010-11-10Paper
Closure, stability and iterated line graphs with a 2-factor
Discrete Mathematics
2009-12-15Paper
Two forbidden subgraphs and the existence of a 2-factor in graphs2009-07-06Paper
Chvátal–Erdős Theorem: Old Theorem with New Aspects
Computational Geometry and Graph Theory
2009-01-13Paper
Chvátal Erdős condition and 2-factors with a specyfied number of components
Discussiones Mathematicae Graph Theory
2008-06-18Paper
Independence and 2-domination in bipartite graphs2008-03-11Paper
Edge-dominating cycles in graphs
Discrete Mathematics
2007-11-30Paper
Reduction for 3-connected graphs of minimum degree at least four
Graphs and Combinatorics
2007-07-19Paper
Graphs with small boundary
Discrete Mathematics
2007-05-11Paper
Degree conditions for Hamiltonicity: counting the number of missing edges
Discrete Mathematics
2007-03-02Paper
scientific article; zbMATH DE number 5043408 (Why is no real title available?)2006-08-03Paper
Domination in a graph with a 2‐factor
Journal of Graph Theory
2006-06-06Paper
A pair of forbidden subgraphs and perfect matchings.
Journal of Combinatorial Theory. Series B
2006-05-18Paper
A note on 2-factors with two components
Discrete Mathematics
2005-10-26Paper
Forbidden subgraphs and bounds on the size of a maximum matching
Journal of Graph Theory
2005-09-22Paper
scientific article; zbMATH DE number 2197874 (Why is no real title available?)2005-08-23Paper
scientific article; zbMATH DE number 2197893 (Why is no real title available?)2005-08-23Paper
A note on internally disjoint alternating paths in bipartite graphs
Discrete Mathematics
2005-02-22Paper
Toughness, degrees and 2-factors
Discrete Mathematics
2004-11-22Paper
Long cycles in triangle-free graphs with prescribed independence number and connectivity
Journal of Combinatorial Theory. Series B
2004-08-06Paper
Vertex-disjoint cycles containing specified vertices in a bipartite graph
Journal of Graph Theory
2004-08-04Paper
Cycles within specified distance from each vertex.
Discrete Mathematics
2004-03-14Paper
\(M\)-alternating paths in \(n\)-extendable bipartite graphs
Discrete Mathematics
2003-08-19Paper
Splitting and contractible edges in 4-connected graphs
Journal of Combinatorial Theory. Series B
2003-08-17Paper
On two equimatchable graph classes
Discrete Mathematics
2003-06-09Paper
Factor criticality and complete closure of graphs
Discrete Mathematics
2003-05-25Paper
Cycles having the same modularity and removable edges in 2-connected graphs
Discrete Mathematics
2003-05-25Paper
Degree conditions for k‐ordered hamiltonian graphs
Journal of Graph Theory
2003-04-03Paper
Claw-free graphs with complete closure
Discrete Mathematics
2002-10-24Paper
Relative length of longest paths and cycles in 3-connected graphs
Journal of Graph Theory
2002-08-08Paper
Hamiltonian cycles in n‐extendable graphs
Journal of Graph Theory
2002-07-11Paper
The Hamiltonicity of bipartite graphs involving neighborhood unions
Discrete Mathematics
2002-05-28Paper
Hamiltonian cycles in \(n\)-factor-critical graphs
Discrete Mathematics
2002-04-16Paper
2-factors in claw-free graphs
Discussiones Mathematicae. Graph Theory
2002-02-17Paper
Vertex-disjoint cycles containing specified edges in a bipartite graph
The Australasian Journal of Combinatorics
2002-01-21Paper
Closure and factor-critical graphs
Discrete Mathematics
2000-12-13Paper
Neighborhood unions and factor critical graphs
Discrete Mathematics
2000-04-09Paper
Closure, 2-factors, and cycle coverings in claw-free graphs2000-02-27Paper
Closure and Hamiltonian-connectivity of claw-free graphs
Discrete Mathematics
1999-11-02Paper
Degree sums and graphs that are not covered by two cycles1999-09-22Paper
Long paths, long cycles, and their relative length1999-06-23Paper
Two recursive theorems on \(n\)-extendibility
Discrete Mathematics
1997-06-10Paper
Fan-type theorem for path-connectivity
Combinatorica
1997-01-23Paper
scientific article; zbMATH DE number 871179 (Why is no real title available?)1996-12-01Paper
Relative length of long paths and cycles in graphs with large degree sums
Journal of Graph Theory
1996-07-14Paper
Essential independent sets and Hamiltonian cycles1996-02-25Paper
Non-contractible edges in a 3-connected graph
Combinatorica
1995-10-17Paper
scientific article; zbMATH DE number 554155 (Why is no real title available?)1994-09-01Paper
Cycles of length 0 modulo 4 in graphs
Discrete Mathematics
1994-06-08Paper
Graphs with a cycle of length divisible by three
Journal of Combinatorial Theory. Series B
1994-06-06Paper
Multiple assignment scheme for sharing secret
Journal of Cryptology
1993-05-16Paper
Cycles of length 2 modulo 3 in graphs
Discrete Mathematics
1993-01-16Paper
One-factors and \(k\)-factors
Discrete Mathematics
1992-06-28Paper
scientific article; zbMATH DE number 38315 (Why is no real title available?)1992-06-28Paper
Contractible edges in non-separating cycles
Combinatorica
1992-06-27Paper
Cycles intersecting a prescribed vertex set
Journal of Graph Theory
1992-06-27Paper
Covering contractible edges in 3‐connected graphs. I: Covers of size three are cutsets
Journal of Graph Theory
1992-06-25Paper
Partitioning regular graphs into equicardinal linear forests
Discrete Mathematics
1992-06-25Paper
Removable edges in 3-connected graphs
Journal of Graph Theory
1990-01-01Paper
scientific article; zbMATH DE number 4160775 (Why is no real title available?)1990-01-01Paper
Long cycles through specified vertices in a graph
Journal of Combinatorial Theory. Series B
1989-01-01Paper
Factors and induced subgraphs
Discrete Mathematics
1988-01-01Paper
Contractible edges in 3-connected graphs
Journal of Combinatorial Theory. Series B
1987-01-01Paper
On component factors
Graphs and Combinatorics
1986-01-01Paper
Regular factors of regular graphs
Journal of Graph Theory
1985-01-01Paper
Toughness and the existence ofk-factors
Journal of Graph Theory
1985-01-01Paper
The binding number of line graphs and total graphs
Graphs and Combinatorics
1985-01-01Paper
Disjoint shortest paths in graphs
Combinatorica
1984-01-01Paper
[a,b-factors of graphs]
Discrete Mathematics
1983-01-01Paper
Refinements of degree conditions for the existence of a spanning tree without small degree stems
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Akira Saito