activity
20152026
most citedProper 3-orientations of bipartite planar graphs with minimum degree at least 3

1 citations · 1 across the 6 of their papers we have counts for

collaborators

6 papers

math.CO2026

Congruence classes of monodromies of even triangulations

Kenta Noguchi

A triangulation is a graph on a surface where every face is triangular. It is well-known that a planar triangulation is -chromatic if and only if is even, that is, all t…

math.CO2022

Spanning bipartite quadrangulations of triangulations of the projective plane

Kenta Noguchi

We completely characterize triangulations of the projective plane that have a spanning bipartite quadrangulation subgraph. This is an affirmative answer to a question by Kündgen an…

math.GT2020

Unknottability of spatial graphs by region crossing changes

Yukari Funakoshi, Kenta Noguchi, Ayaka Shimizu

A region crossing change is a local transformation on spatial graph diagrams switching the over/under relations at all the crossings on the boundary of a region. In this paper, we…

math.CO2019★ 1 cited

Proper 3-orientations of bipartite planar graphs with minimum degree at least 3

Kenta Noguchi

We show that every bipartite planar graph with minimum degree at least 3 has proper orientation number at most 3.

cs.DM2018

Non-crossing geometric spanning trees with bounded degree and monochromatic leaves on bicolored point sets

Mikio Kano, Kenta Noguchi, David Orden

Let and be a set of red points and a set of blue points in the plane, respectively, such that is in general position, and let be a fu…

math.CO2015

On Homeomorphically Irreducible Spanning Trees in Cubic Graphs

Arthur Hoffmann-Ostenhof, Kenta Noguchi, Kenta Ozeki

A spanning tree without a vertex of degree two is called a Hist which is an abbreviation for homeomorphically irreducible spanning tree. We provide a necessary condition for the ex…