Searcharxiv⌕ Search

arXiv subjects

Kenta Noguchi

Publications and source records attributed to Kenta Noguchi.

12 recordsLinked to original sources
arXiv2026

Congruence classes of monodromies of even triangulations

A triangulation is a graph on a surface where every face is triangular. It is well-known that a planar triangulation $G$ is $3$-chromatic if and only if $G$ is even, that is, all the vertices of $G$ have even degree. We focus on even triangulations of non-spherical surfaces. It is known that there is an invariant of even triangulations, called a monodromy. This concept was firstly introduced by Hutchinson et al. [J. Combin. Theory Ser. B 84 (2002) 225--239], and the congruence class of monodromies was defined by Kawarabayashi et al. [J. Combin. Theory Ser. B 99 (2009) 229--246]. For a lower genus surface $F^2$, the number of congruence classes of monodromies have already been shown, $1$ if $F^2$ is the sphere, $2$ if $F^2$ is the projective plane by Mohar [Discrete Math. 244 (2002) 339--343] and $3$ if $F^2$ is the torus by Higuchi et al. [Discrete Math. 311 (2011) 1128--1135]. In this paper, we count the number of congruence classes of monodromies of even triangulations of general closed surface $F^2$.

math.CO↗
arXiv2025

Toroidal Cartesian Products Where One Factor is 3-Connected

In this paper, we show that if $G$ is $3$-connected, then the Cartesian product of graphs $G \square H$ embeds on the torus if and only if $G$ is outer-cylindrical and $H$ is a path on two vertices, $P_2$. As a by-product of our work, we also show that $K_{4} \square P_{3}$ has genus two.

math.CO↗
arXiv2024

Spanning plane subgraphs of $1$-plane graphs

A graph drawn on the plane is called $1$-plane if each edge is crossed at most once by another edge. In this paper, we show that every $4$-connected $1$-plane graph has a connected spanning plane subgraph. We also show that there exist infinitely many $4$-connected $1$-plane graphs that have no $2$-connected spanning plane subgraphs. Moreover, we consider the condition of $k$ and $l$ such that every $k$-connected $1$-plane graph has an $l$-connected spanning plane subgraph.

math.CO↗
arXiv2024

HIST-Critical Graphs and Malkevitch's Conjecture

In a given graph, a HIST is a spanning tree without $2$-valent vertices. Motivated by developing a better understanding of HIST-free graphs, i.e. graphs containing no HIST, in this article's first part we study HIST-critical graphs, i.e. HIST-free graphs in which every vertex-deleted subgraph does contain a HIST (e.g. a triangle). We give an almost complete characterisation of the orders for which these graphs exist and present an infinite family of planar examples which are $3$-connected and in which nearly all vertices are $4$-valent. This leads naturally to the second part in which we investigate planar $4$-regular graphs with and without HISTs, motivated by a conjecture of Malkevitch, which we computationally verify up to order $22$. First we enumerate HISTs in antiprisms, whereafter we present planar $4$-regular graphs with and without HISTs, obtained via line graphs. Finally, we confirm Malkevitch's conjecture for the family of line graphs of cyclically $4$-edge connected cubic graphs.

math.CO↗
arXiv2023

Spanning trees for many different numbers of leaves

Let $G$ be a connected graph and $L(G)$ the set of all integers $k$ such that $G$ contains a spanning tree with exactly $k$ leaves. We show that for a connected graph $G$, the set $L(G)$ is contiguous. It follows from work of Chen, Ren, and Shan that every connected and locally connected $n$-vertex graph -- this includes triangulations -- has a spanning tree with at least $n/2 + 1$ leaves, so by a classic theorem of Whitney and our result, in any plane $4$-connected $n$-vertex triangulation one can find for any integer $k$ which is at least $2$ and at most $n/2 + 1$ a spanning tree with exactly $k$ leaves (and each of these trees can be constructed in polynomial time). We also prove that there exist infinitely many $n$ such that there is a plane $4$-connected $n$-vertex triangulation containing a spanning tree with $2n/3$ leaves, but no spanning tree with more than $2n/3$ leaves.

math.CO↗
arXiv2023

Face sizes and the connectivity of the dual

For each $c\ge 1$ we prove tight lower bounds on face sizes that must be present to allow $1$- or $2$-cuts in simple duals of $c$-connected maps. Using these bounds, we determine the smallest genus on which a $c$-connected map can have a simple dual with a $2$-cut and give lower and some upper bounds for the smallest genus on which a $c$-connected map can have a simple dual with a $1$-cut.

math.CO↗
arXiv2020

Unknottability of spatial graphs by region crossing changes

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 show that a spatial graph of a planar graph is unknottable by region crossing changes if and only if the spatial graph is non-Eulerian or is Eulerian and proper.

math.GT↗
arXiv2018

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

Let $R$ and $B$ be a set of red points and a set of blue points in the plane, respectively, such that $R\cup B$ is in general position, and let $f:R \to \{2,3,4, \ldots \}$ be a function. We show that if $2\le |B|\le \sum_{x\in R}(f(x)-2) + 2$, then there exists a non-crossing geometric spanning tree $T$ on $R\cup B$ such that $2\le \operatorname{deg}_T(x)\le f(x)$ for every $x\in R$ and the set of leaves of $T$ is $B$, where every edge of $T$ is a straight-line segment.

cs.DM↗
arXiv2017

On Homeomorphically Irreducible Spanning Trees in Cubic Graphs

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 existence of a Hist in a cubic graph. As one consequence, we answer affirmatively an open question on Hists by Albertson, Berman, Hutchinson and Thomassen.

math.CO↗