The following pages link to Akira Saito (Q214981):
Displaying 50 items.
- Ralph Faudree (1938--2015) (Q279190) (← links)
- Forbidden subgraphs generating a finite set (Q383734) (← links)
- Hamiltonian cycles with all small even chords (Q409469) (← links)
- Star-factors with large components (Q427856) (← links)
- [a,b]-factors of graphs (Q594900) (← links)
- Small alliances in a weighted graph (Q608301) (← links)
- The Ryjáček closure and a forbidden subgraph (Q726640) (← links)
- Disjoint shortest paths in graphs (Q762495) (← links)
- Forbidden pairs for \(k\)-connected Hamiltonian graphs (Q764879) (← links)
- Clique or hole in claw-free graphs (Q765186) (← links)
- Degree conditions for Hamiltonicity: counting the number of missing edges (Q868355) (← links)
- Graphs with small boundary (Q879396) (← links)
- Spanning trees homeomorphic to a small tree (Q898126) (← links)
- Closure, stability and iterated line graphs with a 2-factor (Q1044973) (← links)
- On component factors (Q1078207) (← links)
- The binding number of line graphs and total graphs (Q1086594) (← links)
- Contractible edges in 3-connected graphs (Q1087557) (← links)
- Factors and induced subgraphs (Q1120595) (← links)
- Partitioning regular graphs into equicardinal linear forests (Q1174174) (← links)
- Contractible edges in non-separating cycles (Q1181016) (← links)
- One-factors and \(k\)-factors (Q1182870) (← links)
- Cycles of length 2 modulo 3 in graphs (Q1197035) (← links)
- Multiple assignment scheme for sharing secret (Q1207695) (← links)
- Long cycles through specified vertices in a graph (Q1262323) (← links)
- Closure and Hamiltonian-connectivity of claw-free graphs (Q1296972) (← links)
- Neighborhood unions and factor critical graphs (Q1301846) (← links)
- Cycles of length 0 modulo 4 in graphs (Q1309447) (← links)
- Graphs with a cycle of length divisible by three (Q1322021) (← links)
- Two recursive theorems on \(n\)-extendibility (Q1356686) (← links)
- Splitting and contractible edges in 4-connected graphs (Q1400957) (← links)
- \(M\)-alternating paths in \(n\)-extendable bipartite graphs (Q1402062) (← links)
- Cycles within specified distance from each vertex. (Q1427481) (← links)
- The Hamiltonicity of bipartite graphs involving neighborhood unions (Q1598839) (← links)
- Edge-symmetric distance-regular coverings of complete graphs: the almost simple case (Q1620780) (← links)
- Cycles with a chord in dense graphs (Q1637124) (← links)
- Spanning trails with maximum degree at most 4 in \(2K_2\)-free graphs (Q1684926) (← links)
- The number of Hamiltonian decompositions of regular graphs (Q1686305) (← links)
- A note on internally disjoint alternating paths in bipartite graphs (Q1764910) (← links)
- On two equimatchable graph classes (Q1810651) (← links)
- Long cycles in triangle-free graphs with prescribed independence number and connectivity (Q1826952) (← links)
- Factor criticality and complete closure of graphs (Q1874349) (← links)
- Cycles having the same modularity and removable edges in 2-connected graphs (Q1874350) (← links)
- Toughness, degrees and 2-factors (Q1887644) (← links)
- Non-contractible edges in a 3-connected graph (Q1900184) (← links)
- Closure and factor-critical graphs (Q1974532) (← links)
- Distance matching extension in cubic bipartite graphs (Q2051886) (← links)
- Spanning bipartite graphs with large degree sum in graphs of odd order (Q2051889) (← links)
- An \((F_3,F_5)\)-partition of planar graphs with girth at least 5 (Q2099458) (← links)
- Further approximations for Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture (Q2121801) (← links)
- Representing split graphs by words (Q2158202) (← links)
