Takamasa Yashima

From MaRDI portal
(Redirected from Person:1720316)



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
On essential independent sets in graphs
Discrete Applied Mathematics
2026-03-19Paper
Degree conditions of two vertices with distance two or three for the existence of a Hamilton cycle passing through a matching in a bipartite graph
Graphs and Combinatorics
2026-01-29Paper
On the initial transition of graphs of Kirkman schedules by the partial team swap
Journal of Combinatorial Optimization
2025-07-18Paper
Cubic graphs having only k-cycles in each 2-factor
Discussiones Mathematicae. Graph Theory
2025-05-12Paper
scientific article; zbMATH DE number 7771746 (Why is no real title available?)2023-11-29Paper
A necessary and sufficient condition for the existence of a properly coloured $f$-factor in an edge-coloured graph2023-11-15Paper
Hamilton cycles passing through a matching in a bipartite graph with high degree sum
Discrete Mathematics
2023-10-30Paper
Panconnectivity in bipartite graphs with large degree sum
Graphs and Combinatorics
2023-04-24Paper
Degree sum condition for the existence of spanning \(k\)-trees in star-free graphs
Discussiones Mathematicae Graph Theory
2022-01-03Paper
Closure and spanning trees with bounded total excess
Graphs and Combinatorics
2021-08-12Paper
Color degree sum conditions for properly colored spanning trees in edge-colored graphs
Discrete Mathematics
2020-09-10Paper
A degree sum condition for the existence of an \(S\)-path-system in a bipartite graph
Discrete Mathematics
2019-08-20Paper
Binding number, minimum degree and \((g,f)\)-factors of graphs2019-03-05Paper
The existence of \(f\)-forests and \(f\)-trees in graphs
Discrete Applied Mathematics
2019-02-08Paper
Neighborhood-union condition for an \([a, b]\)-factor avoiding a specified Hamiltonian cycle
Discrete Mathematics
2017-08-29Paper
A degree condition implying ore-type condition for even \([2,b]\)-factors in graphs
Discussiones Mathematicae Graph Theory
2017-07-17Paper
A degree condition for graphs to be fractional ID-\([a,b]\)-factor-critical
The Australasian Journal of Combinatorics
2016-09-14Paper
Existence of 3-factors in 2-connected star-free graphs
Far East Journal of Applied Mathematics
2013-11-19Paper


Research outcomes over time


This page was built for person: Takamasa Yashima