Kenta Ozeki

From MaRDI portal
Revision as of 18:33, 6 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:307915

Available identifiers

zbMath Open ozeki.kentaMaRDI QIDQ307915

List of research outcomes

PublicationDate of PublicationType
A spanning tree with at most \(k\) leaves in a \(K_{1,p}\)-free graph2024-02-16Paper
\(H\)-colorings for 4-regular graphs2024-01-17Paper
A necessary and sufficient condition for the existence of a properly coloured $f$-factor in an edge-coloured graph2023-11-15Paper
On reachable assignments under dichotomous preferences2023-10-26Paper
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams2023-10-23Paper
A forbidden pair for connected graphs to have spanning k‐trees2023-10-05Paper
Single‐conflict colouring2023-09-29Paper
Note on fair game edge-connectivity of graphs2023-04-27Paper
Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey2023-03-31Paper
A 2-bisection with small number of monochromatic edges of a claw-free cubic graph2023-03-09Paper
An Even 2-Factor in the Line Graph of a Cubic Graph2022-12-15Paper
Reconfiguration of colorings in triangulations of the sphere2022-10-31Paper
Rerouting Planar Curves and Disjoint Paths2022-10-21Paper
Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings2022-10-14Paper
Reforming an Envy-Free Matching2022-07-06Paper
Covering projective planar graphs with three forests2022-02-14Paper
The Alon-Tarsi number of \(K_5\)-minor-free graphs2022-02-14Paper
Proper colorings of plane quadrangulations without rainbow faces2021-11-25Paper
The Color Number of Cubic Graphs Having a Spanning Tree with a Bounded Number of Leaves2021-09-28Paper
Highly edge‐connected factors using given lists on degrees2021-06-25Paper
2-factors of cubic bipartite graphs2021-06-14Paper
On minimum leaf spanning trees and a criticality notion2020-05-21Paper
A complete bipartite graph without properly colored cycles of length four2020-05-21Paper
Orientations of graphs avoiding given lists on out‐degrees2020-05-21Paper
Thomassen's conjecture for line graphs of 3-hypergraphs2020-04-21Paper
Long paths in bipartite graphs and path-bistar bipartite Ramsey numbers2020-03-03Paper
Types of triangle in Hamiltonian triangulations and an application to domination and k-walks2020-02-21Paper
A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity2020-01-17Paper
Book Embedding of Graphs on the Projective Plane2019-10-25Paper
On the minimum leaf number of cubic graphs2019-09-11Paper
Extension to 3-Colorable Triangulations2019-08-29Paper
\([a,b\)-factors of graphs on surfaces]2019-06-18Paper
A note on a Brooks' type theorem for DP‐coloring2019-06-14Paper
https://portal.mardi4nfdi.de/entity/Q53770212019-05-23Paper
4-connected projective-planar graphs are hamiltonian-connected2019-05-15Paper
https://portal.mardi4nfdi.de/entity/Q57434292019-05-10Paper
Hamiltonicity of planar graphs with a forbidden minor2019-04-25Paper
Spanning bipartite quadrangulations of even triangulations2019-03-28Paper
A new approach towards a conjecture on intersecting three longest paths2019-01-28Paper
Sufficient conditions for the existence of a path‐factor which are related to odd components2019-01-03Paper
Every 4-Connected Graph with Crossing Number 2 is Hamiltonian2018-12-05Paper
On homeomorphically irreducible spanning trees in cubic graphs2018-10-31Paper
3-dynamic coloring of planar triangulations2018-09-21Paper
Decomposing planar cubic graphs2018-08-16Paper
Hamiltonian properties of polyhedra with few 3-cuts. A survey2018-07-26Paper
Non-Hamiltonian triangulations with distant separating triangles2018-05-24Paper
A sufficient condition for DP-4-colorability2018-05-24Paper
Grünbaum colorings of even triangulations on surfaces2018-04-27Paper
Pairs of forbidden subgraphs and 2-connected supereulerian graphs2018-04-19Paper
Single-conflict colouring2018-03-29Paper
On upper bounds for the independent transversal domination number2018-01-11Paper
https://portal.mardi4nfdi.de/entity/Q45951762017-11-29Paper
Plane Triangulations Without a Spanning Halin Subgraph II2017-11-02Paper
Matching Extension Missing Vertices and Edges in Triangulations of Surfaces2017-06-30Paper
On two conjectures about the proper connection number of graphs2017-06-23Paper
On Dominating Even Subgraphs in Cubic Graphs2017-05-24Paper
Vertex coloring of graphs by total 2-weightings2017-01-13Paper
Every 5-connected planar triangulation is 4-ordered Hamiltonian2016-09-05Paper
Cyclic 4-Colorings of Graphs on Surfaces2016-08-12Paper
A Characterization of $K_{2,4}$-Minor-Free Graphs2016-05-26Paper
5-Connected Toroidal Graphs are Hamiltonian-Connected2016-01-15Paper
\(m\)-dominating \(k\)-trees of graphs2015-12-08Paper
A Relationship Between Thomassen's Conjecture and Bondy's Conjecture2015-11-27Paper
Extension to Even Triangulations2015-10-30Paper
The existence of semi-colorings in a graph2015-09-24Paper
Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs2015-09-24Paper
A toughness condition for a spanning tree with bounded total excesses2015-09-24Paper
Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász--Plummer Conjecture on Halin Graphs2015-08-17Paper
https://portal.mardi4nfdi.de/entity/Q55003712015-08-05Paper
Spanning Trees with Vertices Having Large Degrees2015-07-23Paper
The chromatic index of a claw-free graph whose core has maximum degree 22015-07-20Paper
Equivalence of Jackson's and Thomassen's conjectures2015-06-22Paper
4-connected projective-planar graphs are Hamiltonian-connected2015-05-04Paper
2-factors with bounded number of components in claw-free graphs2015-01-30Paper
Spanning \(k\)-trees of bipartite graphs2015-01-22Paper
Spanning closed walks and TSP in 3-connected planar graphs2014-10-22Paper
A simpler proof for the two disjoint odd cycles theorem2014-10-06Paper
Spanning trees with a bounded number of branch vertices in a claw-free graph2014-09-19Paper
On the ratio of the domination number and the independent domination number in graphs2014-09-12Paper
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees2014-08-14Paper
2-edge-Hamiltonian-connectedness of 4-connected plane graphs2014-07-29Paper
Forbidden Subgraphs Generating Almost the Same Sets2014-02-24Paper
Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles2014-01-28Paper
Forbidden induced subgraphs for near perfect matchings2013-12-02Paper
https://portal.mardi4nfdi.de/entity/Q28573942013-11-01Paper
Spanning trees in 3-connected K3,t-minor-free graphs2013-10-10Paper
${4,5}$ Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski2013-06-27Paper
Spanning Trees with Bounded Maximum Degrees of Graphs on Surfaces2013-06-27Paper
Partitioning graphs into paths or cycles of prescribed lengths2013-02-28Paper
Hamiltonian cycles in bipartite toroidal graphs with a partite set of degree four vertices2013-01-18Paper
Length of longest cycles in a graph whose relative length is at least two2013-01-03Paper
https://portal.mardi4nfdi.de/entity/Q48974732012-12-19Paper
Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs2012-10-19Paper
Book Embedding of Toroidal Bipartite Graphs2012-09-12Paper
Claw-free graphs and 2-factors that separate independent vertices2012-06-13Paper
Forbidden induced subgraphs for star-free graphs2012-04-13Paper
https://portal.mardi4nfdi.de/entity/Q28812552012-04-03Paper
Hamiltonian cycles in bipartite quadrangulations on the torus2012-02-08Paper
Spanning trees: A survey2012-01-24Paper
2-factors and independent sets on claw-free graphs2012-01-11Paper
A note on total excess of spanning trees2011-12-01Paper
2- and 3-factors of graphs on surfaces2011-08-16Paper
The independence number condition for the existence of a spanning f-tree2011-01-19Paper
Non-separating subgraphs after deleting many disjoint paths2011-01-14Paper
Rainbow generalizations of Ramsey theory: A survey2010-11-12Paper
A \(k\)-tree containing specified vertices2010-11-12Paper
A spanning tree with high degree vertices2010-11-12Paper
4-connected triangulations and 4-orderedness2010-10-11Paper
Set-orderedness as a generalization of \(k\)-orderedness and cyclability2010-10-11Paper
A simple algorithm for 4-coloring 3-colorable planar graphs2010-06-07Paper
On relative length of longest paths and cycles2009-12-18Paper
A degree sum condition for graphs to be prism Hamiltonian2009-12-10Paper
Hamiltonian cycles and dominating cycles passing through a linear forest2009-06-17Paper
A degree sum condition concerning the connectivity and the independence number of a graph2009-04-29Paper
Long cycles in graphs without Hamiltonian paths2009-01-28Paper
A note on a longest cycle which is vertex dominating2008-06-18Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Kenta Ozeki