The following pages link to Kenta Ozeki (Q307915):
Displaying 50 items.
- Every 5-connected planar triangulation is 4-ordered Hamiltonian (Q307916) (← links)
- Forbidden induced subgraphs for near perfect matchings (Q385401) (← links)
- A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees (Q397062) (← links)
- Forbidden induced subgraphs for star-free graphs (Q409360) (← links)
- Spanning closed walks and TSP in 3-connected planar graphs (Q462924) (← links)
- Spanning \(k\)-trees of bipartite graphs (Q490315) (← links)
- The existence of semi-colorings in a graph (Q497333) (← links)
- Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs (Q497365) (← links)
- A toughness condition for a spanning tree with bounded total excesses (Q497366) (← links)
- Vertex coloring of graphs by total 2-weightings (Q503639) (← links)
- Rainbow generalizations of Ramsey theory: A survey (Q604649) (← links)
- A \(k\)-tree containing specified vertices (Q604665) (← links)
- A spanning tree with high degree vertices (Q604984) (← links)
- Non-separating subgraphs after deleting many disjoint paths (Q618034) (← links)
- A note on total excess of spanning trees (Q647240) (← links)
- 2-factors and independent sets on claw-free graphs (Q658040) (← links)
- Spanning trees: A survey (Q659663) (← links)
- 4-connected triangulations and 4-orderedness (Q708369) (← links)
- Set-orderedness as a generalization of \(k\)-orderedness and cyclability (Q708377) (← links)
- Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs (Q713980) (← links)
- Hamiltonian properties of polyhedra with few 3-cuts. A survey (Q724894) (← links)
- On the ratio of the domination number and the independent domination number in graphs (Q741547) (← links)
- Spanning trees with a bounded number of branch vertices in a claw-free graph (Q742583) (← links)
- A simpler proof for the two disjoint odd cycles theorem (Q744153) (← links)
- \(m\)-dominating \(k\)-trees of graphs (Q898133) (← links)
- A note on a longest cycle which is vertex dominating (Q928541) (← links)
- A simple algorithm for 4-coloring 3-colorable planar graphs (Q974757) (← links)
- Long cycles in graphs without Hamiltonian paths (Q998320) (← links)
- A degree sum condition concerning the connectivity and the independence number of a graph (Q1014827) (← links)
- Hamiltonian cycles and dominating cycles passing through a linear forest (Q1024474) (← links)
- A degree sum condition for graphs to be prism Hamiltonian (Q1043943) (← links)
- On upper bounds for the independent transversal domination number (Q1693131) (← links)
- A new approach towards a conjecture on intersecting three longest paths (Q1713782) (← links)
- Pairs of forbidden subgraphs and 2-connected supereulerian graphs (Q1744755) (← links)
- Non-Hamiltonian triangulations with distant separating triangles (Q1752660) (← links)
- A sufficient condition for DP-4-colorability (Q1752670) (← links)
- 3-dynamic coloring of planar triangulations (Q1783610) (← links)
- Length of longest cycles in a graph whose relative length is at least two (Q1928283) (← links)
- Hamiltonian cycles in bipartite toroidal graphs with a partite set of degree four vertices (Q1932471) (← links)
- Partitioning graphs into paths or cycles of prescribed lengths (Q1937351) (← links)
- 2-factors of cubic bipartite graphs (Q2032697) (← links)
- Proper colorings of plane quadrangulations without rainbow faces (Q2051893) (← links)
- Covering projective planar graphs with three forests (Q2075505) (← links)
- The Alon-Tarsi number of \(K_5\)-minor-free graphs (Q2075517) (← links)
- Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings (Q2084984) (← links)
- Thomassen's conjecture for line graphs of 3-hypergraphs (Q2174582) (← links)
- On minimum leaf spanning trees and a criticality notion (Q2182204) (← links)
- Long paths in bipartite graphs and path-bistar bipartite Ramsey numbers (Q2303439) (← links)
- On the minimum leaf number of cubic graphs (Q2324488) (← links)
- 4-connected projective-planar graphs are Hamiltonian-connected (Q2343285) (← links)
