![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Kenta Noguchi
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j18]Naoki Matsumoto
, Kenta Noguchi
, Takamasa Yashima
:
Cubic graphs having only k-cycles in each 2-factor. Discuss. Math. Graph Theory 44(1): 281 (2024) - [j17]Kenta Noguchi
:
Spanning Bipartite Quadrangulations of Triangulations of the Projective Plane. SIAM J. Discret. Math. 38(2): 1250-1268 (2024) - 2021
- [j16]Kengo Enami
, Kenta Noguchi
:
Embeddings of a Graph into a Surface with Different Weak Chromatic Numbers. Graphs Comb. 37(2): 435-444 (2021) - 2020
- [j15]Kenta Noguchi
:
Proper 3-orientations of bipartite planar graphs with minimum degree at least 3. Discret. Appl. Math. 279: 195-197 (2020) - 2019
- [j14]Ryota Matsubara, Haruhide Matsuda
, Nana Matsuo, Kenta Noguchi
, Kenta Ozeki
:
[a, b]-factors of graphs on surfaces. Discret. Math. 342(7): 1979-1988 (2019) - [j13]Atsuhiro Nakamoto, Kenta Noguchi
, Kenta Ozeki
:
Spanning bipartite quadrangulations of even triangulations. J. Graph Theory 90(3): 267-287 (2019) - [j12]Atsuhiro Nakamoto, Kenta Noguchi
, Kenta Ozeki
:
Extension to 3-Colorable Triangulations. SIAM J. Discret. Math. 33(3): 1390-1414 (2019) - 2018
- [j11]Michal Kotrbcík, Naoki Matsumoto, Bojan Mohar, Atsuhiro Nakamoto, Kenta Noguchi
, Kenta Ozeki
, Andrej Vodopivec:
Grünbaum colorings of even triangulations on surfaces. J. Graph Theory 87(4): 475-491 (2018) - [j10]Arthur Hoffmann-Ostenhof, Kenta Noguchi
, Kenta Ozeki
:
On homeomorphically irreducible spanning trees in cubic graphs. J. Graph Theory 89(2): 93-100 (2018) - [j9]Taku Nagasawa, Kenta Noguchi
, Yusuke Suzuki:
No optimal 1-planar graph triangulates any nonorientable closed surface. J. Graph Theory 89(3): 350-360 (2018) - 2017
- [j8]Kenta Noguchi:
Optimal 1-planar graphs which quadrangulate other surfaces. Australas. J Comb. 69: 169- (2017) - [j7]Kenta Noguchi
:
Even Embeddings of the Complete Graphs and Their Cycle Parities. J. Graph Theory 85(1): 187-206 (2017) - 2016
- [j6]Atsuhiro Nakamoto, Kenta Noguchi
, Kenta Ozeki
:
Cyclic 4-Colorings of Graphs on Surfaces. J. Graph Theory 82(3): 265-278 (2016) - 2015
- [j5]Kenta Noguchi
, Yusuke Suzuki:
Relationship Among Triangulations, Quadrangulations and Optimal 1-Planar Graphs. Graphs Comb. 31(6): 1965-1972 (2015) - [j4]Atsuhiro Nakamoto, Kenta Noguchi
, Kenta Ozeki
:
Extension to Even Triangulations. SIAM J. Discret. Math. 29(4): 2075-2087 (2015) - 2014
- [j3]Naoki Matsumoto, Kenta Noguchi:
Uniquely colorable graphs on surfaces. Ars Comb. 114: 177-183 (2014) - [j2]Kenta Noguchi
:
The Empire Problem in Even Embeddings on Closed Surfaces. J. Graph Theory 75(1): 20-30 (2014) - 2013
- [j1]Kenta Noguchi
:
The empire problem in even embeddings on closed surfaces with ε≤0ε≤0. Discret. Math. 313(19): 1944-1951 (2013)
Informal and Other Publications
- 2024
- [i2]Jan Goedgebeur, Kenta Noguchi, Jarne Renders, Carol T. Zamfirescu:
HIST-Critical Graphs and Malkevitch's Conjecture. CoRR abs/2401.04554 (2024) - 2018
- [i1]Mikio Kano, Kenta Noguchi, David Orden:
Non-crossing geometric spanning trees with bounded degree and monochromatic leaves on bicolored point sets. CoRR abs/1812.02866 (2018)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint