Shun-ichi Maezawa

Orcid: 0000-0003-1607-8665

According to our database1, Shun-ichi Maezawa authored at least 18 papers between 2019 and 2024.

Collaborative distances:

Timeline

2019
2020
2021
2022
2023
2024
0
1
2
3
4
5
6
1
1
5
3
2
2
4

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A graph minor condition for graphs to be k-linked.
Eur. J. Comb., February, 2024

2023
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams.
ACM Trans. Algorithms, January, 2023

Reconfiguration of Time-Respecting Arborescences.
Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Rerouting Planar Curves and Disjoint Paths.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Reconfiguration of Colorings in Triangulations of the Sphere.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022
A forbidden pair for connected graphs to have spanning k-trees.
J. Graph Theory, 2022

Maximum properly colored trees in edge-colored graphs.
J. Comb. Optim., 2022

Characterization of (m, n)-Linked Planar Graphs.
Graphs Comb., 2022

Degree sum condition for the existence of spanning <i>k</i>-trees in star-free graphs.
Discuss. Math. Graph Theory, 2022

Special Case of Rota's Basis Conjecture on Graphic Matroids.
Electron. J. Comb., 2022

2021
On 3-polytopes with non-Hamiltonian prisms.
J. Graph Theory, 2021

Closure and Spanning Trees with Bounded Total Excess.
Graphs Comb., 2021

A Fan-type condition for graphs to be k-leaf-connected.
Discret. Math., 2021

2020
Long Paths in Bipartite Graphs and Path-Bistar Bipartite Ramsey Numbers.
Graphs Comb., 2020

Color degree sum conditions for properly colored spanning trees in edge-colored graphs.
Discret. Math., 2020

2019
Degree Conditions for Graphs to Have Spanning Trees with Few Branch Vertices and Leaves.
Graphs Comb., 2019

Connected odd factors of graphs.
Australas. J Comb., 2019


  Loading...