Kenta Ozeki

Discret. Appl. Math., 2026

List orientation number of graphs.

[BibT_eX]

[DOI]

Toshiki Abe

Discret. Appl. Math., 2026

2025

Brooks' Type Theorem for Indicated Coloring Game.

[BibT_eX]

[DOI]

Graphs Comb., December, 2025

Spanning Path-Cycle Systems with Given End-Vertices in Regular Graphs.

[BibT_eX]

[DOI]

Mikio Kano

Graphs Comb., December, 2025

On k-Edge-Hamilton-Connected Line Graphs.

[BibT_eX]

[DOI]

Baoleer

J. Graph Theory, 2025

Coloring zonotopal quadrangulations of the projective space.

[BibT_eX]

[DOI]

Masahiro Hachimori

Eur. J. Comb., 2025

A spanning tree with at most k leaves in a K1,5-free graph.

[BibT_eX]

[DOI]

Discret. Math., 2025

2-Connected spanning subgraphs of circuit graphs.

[BibT_eX]

[DOI]

Daiki Takahashi

Discret. Math., 2025

An odd 4-coloring of a maximal outerplanar graph.

[BibT_eX]

[DOI]

Discret. Math., 2025

2024

On strict-double-bound graphs and Cartesian products of paths and cycles.

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., July, 2024

H-colorings for 4-regular graphs.

[BibT_eX]

[DOI]

Analen Malnegro

Discret. Math., March, 2024

Reconfiguration of Independent Transversals.

[BibT_eX]

[DOI]

Pjotr Buys

Ross J. Kang

CoRR, 2024

2023

Note on fair game edge-connectivity of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., July, 2023

A 2-Bisection with Small Number of Monochromatic Edges of a Claw-Free Cubic Graph.

[BibT_eX]

[DOI]

Seungjae Eom

Graphs Comb., February, 2023

Arithmetic progressions, quasi progressions, and Gallai-Ramsey colorings.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2023

A necessary and sufficient condition for the existence of a properly coloured f-factor in an edge-coloured graph.

[BibT_eX]

[DOI]

CoRR, 2023

A Spanning Tree with at Most $k$ Leaves in a $K_{1,p}$-Free Graph.

[BibT_eX]

[DOI]

Masao Tsugaki

Electron. J. Comb., 2023

Rerouting Planar Curves and Disjoint Paths.

[BibT_eX]

[DOI]

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Reconfiguration of Colorings in Triangulations of the Sphere.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

Kempe Equivalence Classes of Cubic Graphs Embedded on the Projective Plane.

[BibT_eX]

[DOI]

Comb., December, 2022

A forbidden pair for connected graphs to have spanning k-trees.

[BibT_eX]

[DOI]

Shun-ichi Maezawa

J. Graph Theory, 2022

Covering projective planar graphs with three forests.

[BibT_eX]

[DOI]

Discret. Math., 2022

The Alon-Tarsi number of K5-minor-free graphs.

[BibT_eX]

[DOI]

Toshiki Abe

Seog-Jin Kim

Discret. Math., 2022

Monotone edge flips to an orientation of maximum edge-connectivity à la Nash-Williams.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

On Reachable Assignments Under Dichotomous Preferences.

[BibT_eX]

[DOI]

Proceedings of the PRIMA 2022: Principles and Practice of Multi-Agent Systems, 2022

Reforming an Envy-Free Matching.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Single-conflict colouring.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

A Note on Enumeration of 3-Edge-Connected Spanning Subgraphs in Plane Graphs.

[BibT_eX]

[DOI]

Yasuko Matsui

IEICE Trans. Inf. Syst., 2021

Proper Colorings of Plane Quadrangulations Without Rainbow Faces.

[BibT_eX]

[DOI]

Kengo Enami

Tomoki Yamaguchi

Graphs Comb., 2021

2-Factors of cubic bipartite graphs.

[BibT_eX]

[DOI]

Nastaran Haghparast

Discret. Math., 2021

2020

A complete bipartite graph without properly colored cycles of length four.

[BibT_eX]

[DOI]

Roman Cada

J. Graph Theory, 2020

Orientations of graphs avoiding given lists on out-degrees.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Long Paths in Bipartite Graphs and Path-Bistar Bipartite Ramsey Numbers.

[BibT_eX]

[DOI]

Shun-ichi Maezawa

Graphs Comb., 2020

On minimum leaf spanning trees and a criticality notion.

[BibT_eX]

[DOI]

Gábor Wiener

Discret. Math., 2020

Thomassen's conjecture for line graphs of 3-hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2020

2019

Book Embedding of Graphs on the Projective Plane.

[BibT_eX]

[DOI]

Takayuki Nozawa

SIAM J. Discret. Math., 2019

Extension to 3-Colorable Triangulations.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Spanning bipartite quadrangulations of even triangulations.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

A note on a Brooks' type theorem for DP?coloring.

[BibT_eX]

[DOI]

Seog-Jin Kim

J. Graph Theory, 2019

Hamiltonicity of planar graphs with a forbidden minor.

[BibT_eX]

[DOI]

Mark N. Ellingham

Emily Abernethy Marshall

Shoichi Tsuchiya

J. Graph Theory, 2019

Highly edge-connected factors using given lists on degrees.

[BibT_eX]

[DOI]

Saieed Akbari

Morteza Hasanvand

J. Graph Theory, 2019

[a, b]-factors of graphs on surfaces.

[BibT_eX]

[DOI]

Discret. Math., 2019

On the minimum leaf number of cubic graphs.

[BibT_eX]

[DOI]

Discret. Math., 2019

A Degree Sum Condition on the Order, the Connectivity and the Independence Number for Hamiltonicity.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

Types of triangle in Hamiltonian triangulations and an application to domination and k-walks.

[BibT_eX]

[DOI]

Gunnar Brinkmann

Nico Van Cleemput

Ars Math. Contemp., 2019

Connected odd factors of graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2019

2018

Every 4-Connected Graph with Crossing Number 2 is Hamiltonian.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Grünbaum colorings of even triangulations on surfaces.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

On homeomorphically irreducible spanning trees in cubic graphs.

[BibT_eX]

[DOI]

Arthur Hoffmann-Ostenhof

J. Graph Theory, 2018

Decomposing planar cubic graphs.

[BibT_eX]

[DOI]

Arthur Hoffmann-Ostenhof

Tomás Kaiser

J. Graph Theory, 2018

Sufficient conditions for the existence of a path-factor which are related to odd components.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

Non-hamiltonian triangulations with distant separating triangles.

[BibT_eX]

[DOI]

Discret. Math., 2018

Hamiltonian properties of polyhedra with few 3-cuts - A survey.

[BibT_eX]

[DOI]

Nico Van Cleemput

Discret. Math., 2018

A sufficient condition for DP-4-colorability.

[BibT_eX]

[DOI]

Seog-Jin Kim

Discret. Math., 2018

Pairs of forbidden subgraphs and 2-connected supereulerian graphs.

[BibT_eX]

[DOI]

Discret. Math., 2018

3-dynamic coloring of planar triangulations.

[BibT_eX]

[DOI]

Discret. Math., 2018

On upper bounds for the independent transversal domination number.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Least conflict choosability.

[BibT_eX]

[DOI]

CoRR, 2018

Hamiltonicity of Graphs on Surfaces in Terms of Toughness and Scattering Number - A Survey.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018

2017

Plane Triangulations Without a Spanning Halin Subgraph II.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

On Dominating Even Subgraphs in Cubic Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Matching Extension Missing Vertices and Edges in Triangulations of Surfaces.

[BibT_eX]

[DOI]

Michael D. Plummer

J. Graph Theory, 2017

On two conjectures about the proper connection number of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2017

Coloring of locally planar graphs with one color class small.

[BibT_eX]

[DOI]

Australas. J Comb., 2017

2016

5-Connected Toroidal Graphs are Hamiltonian-Connected.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

A Characterization of K2, 4-Minor-Free Graphs.

[BibT_eX]

[DOI]

Mark N. Ellingham

Emily Abernethy Marshall

Shoichi Tsuchiya

SIAM J. Discret. Math., 2016

Cyclic 4-Colorings of Graphs on Surfaces.

[BibT_eX]

[DOI]

J. Graph Theory, 2016

Vertex Coloring of Graphs by Total 2-Weightings.

[BibT_eX]

[DOI]

Graphs Comb., 2016

Decomposing plane cubic graphs.

[BibT_eX]

[DOI]

Dong Ye

Eur. J. Comb., 2016

m-dominating k-trees of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2016

2015

Extension to Even Triangulations.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász-Plummer Conjecture on Halin Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

A Relationship Between Thomassen's Conjecture and Bondy's Conjecture.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

Spanning Trees with Vertices Having Large Degrees.

[BibT_eX]

[DOI]

J. Graph Theory, 2015

Equivalence of Jackson's and Thomassen's conjectures.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

Spanning k-Forests with Large Components in K1, k+1-Free Graphs.

[BibT_eX]

[DOI]

Takeshi Sugiyama

Graphs Comb., 2015

A Toughness Condition for a Spanning Tree With Bounded Total Excesses.

[BibT_eX]

[DOI]

Graphs Comb., 2015

The Existence of Semi-colorings in a Graph.

[BibT_eX]

[DOI]

Masaru Kamada

Graphs Comb., 2015

The Chromatic Index of a Claw-Free Graph Whose Core has Maximum Degree 2.

[BibT_eX]

[DOI]

Saieed Akbari

Maryam Ghanbari

Graphs Comb., 2015

2-factors with bounded number of components in claw-free graphs.

[BibT_eX]

[DOI]

Zdenek Ryjácek

Discret. Math., 2015

{0, 2}-Degree free spanning forests in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

Spanning $k$-trees of Bipartite Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

2014

Improved Upper Bounds for Gallai-Ramsey Numbers of Paths and Cycles.

[BibT_eX]

[DOI]

J. Graph Theory, 2014

Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph.

[BibT_eX]

[DOI]

Haruhide Matsuda

Graphs Comb., 2014

2-edge-Hamiltonian-connectedness of 4-connected plane graphs.

[BibT_eX]

[DOI]

Petr Vrána

Eur. J. Comb., 2014

On the ratio of the domination number and the independent domination number in graphs.

[BibT_eX]

[DOI]

Akinari Sasaki

Discret. Appl. Math., 2014

A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees.

[BibT_eX]

[DOI]

Comb., 2014

2013

Spanning Trees with Bounded Maximum Degrees of Graphs on Surfaces.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

4, 5 Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

A simpler proof for the two disjoint odd cycles theorem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2013

Hamiltonian cycles in bipartite toroidal graphs with a partite set of degree four vertices.

[BibT_eX]

[DOI]

Jun Fujisawa

J. Comb. Theory B, 2013

Forbidden induced subgraphs for near perfect matchings.

[BibT_eX]

[DOI]

Katsuhiro Ota

Gabriel Sueiro

Discret. Math., 2013

Forbidden Subgraphs Generating Almost the Same Sets.

[BibT_eX]

[DOI]

Shinya Fujita

Comb. Probab. Comput., 2013

4-connected projective-planar graphs are hamiltonian-connected.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

2012

Book Embedding of Toroidal Bipartite Graphs.

[BibT_eX]

[DOI]

Katsuhiro Ota

SIAM J. Discret. Math., 2012

Hamiltonian cycles in bipartite quadrangulations on the torus.

[BibT_eX]

[DOI]

J. Graph Theory, 2012

Claw-free graphs and 2-factors that separate independent vertices.

[BibT_eX]

[DOI]

J. Graph Theory, 2012

Length of Longest Cycles in a Graph Whose Relative Length is at Least Two.

[BibT_eX]

[DOI]

Graphs Comb., 2012

2-factors and independent sets on claw-free graphs.

[BibT_eX]

[DOI]

Roman Kuzel

Discret. Math., 2012

Spanning trees with a bounded number of leaves in a claw-free graph.

[BibT_eX]

Ars Comb., 2012

Spanning closed walks and TSP in 3-connected planar graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

2- and 3-factors of graphs on surfaces.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

Non-separating subgraphs after deleting many disjoint paths.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2011

Spanning Trees: A Survey.

[BibT_eX]

[DOI]

Graphs Comb., 2011

Hamilton cycles in 4-connected troidal triangulations.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Forbidden induced subgraphs for star-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2011

Dominating cycles in triangle-free graphs.

[BibT_eX]

Ars Comb., 2011

2010

A simple algorithm for 4-coloring 3-colorable planar graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

The independence number condition for the existence of a spanning f-tree.

[BibT_eX]

[DOI]

Hikoe Enomoto

J. Graph Theory, 2010

A Spanning Tree with High Degree Vertices.

[BibT_eX]

[DOI]

Graphs Comb., 2010

Rainbow Generalizations of Ramsey Theory: A Survey.

[BibT_eX]

[DOI]

Shinya Fujita

Colton Magnant

Graphs Comb., 2010

A k-Tree Containing Specified Vertices.

[BibT_eX]

[DOI]

Graphs Comb., 2010

4-connected triangulations and 4-orderedness.

[BibT_eX]

[DOI]

Raiji Mukae

Discret. Math., 2010

Set-orderedness as a generalization of k-orderedness and cyclability.

[BibT_eX]

[DOI]

Keishi Ishii

Discret. Math., 2010

2009

On relative length of longest paths and cycles.

[BibT_eX]

[DOI]

Masao Tsugaki

J. Graph Theory, 2009

Spanning trees in 3-connected K3, t-minor-free graphs.

[BibT_eX]

[DOI]

Katsuhiro Ota

Electron. Notes Discret. Math., 2009

Hamiltonian cycles and dominating cycles passing through a linear forest.

[BibT_eX]

[DOI]

Discret. Math., 2009

A degree sum condition for graphs to be prism hamiltonian.

[BibT_eX]

[DOI]

Discret. Math., 2009

2008

A Degree Sum Condition Concerning the Connectivity and the Independence Number of a Graph.

[BibT_eX]

[DOI]

Graphs Comb., 2008

Long cycles in graphs without hamiltonian paths.

[BibT_eX]

[DOI]