Shuichi Ueno

1. On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
   1988/12/01 by Shuichi Ueno, Yoji Kajitani, Shin'ya Gotoh · 1 citation
   Computer Science · Engineering · Mathematics · #1-planar graph #Advanced Graph Theory Research #Chordal graph #Combinatorics #Computer science #Degree (music) #Discrete mathematics #Feedback vertex set #Graph #Independent set #Mathematics #Matroid #Maximal independent set #Set (abstract data type) #VLSI and Analog Circuit Testing #VLSI and FPGA Design Techniques #Vertex (graph theory) #Vertex cover
2. Minimal acyclic forbidden minors for the family of graphs with bounded path-width
   1994/03/01 by Atsushi Takahashi, Shuichi Ueno, Yoji Kajitani · 1 citation
   Computer Science · Mathematics · #1-planar graph #Advanced Graph Theory Research #Bounded function #Chordal graph #Combinatorics #Computer science #Discrete mathematics #Graph #Indifference graph #Induced path #Interconnection Networks and Systems #Limits and Structures in Graph Theory #Line graph #Longest path problem #Mathematics #Minor (academic) #Path (computing) #Pathwidth #Robertson–Seymour theorem