Jun Fujisawa

,

J. Graph Theory, 2023

Game chromatic number of strong product graphs.

[BibT_eX]

[DOI]

,

,

Naoki Matsumoto

Discret. Math., 2023

Induced Nets and Hamiltonicity of Claw-Free Graphs.

[BibT_eX]

[DOI]

Shuya Chiba

,

Graphs Comb., 2021

Distance Matching Extension in Cubic Bipartite Graphs.

[BibT_eX]

[DOI]

,

,

Graphs Comb., 2021

Edge proximity and matching extension in projective planar graphs.

[BibT_eX]

[DOI]

,

Hiroki Seno

J. Graph Theory, 2020

Distance matching extension and local structure of graphs.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 2020

Non-hamiltonian 1-tough triangulations with disjoint separating triangles.

[BibT_eX]

[DOI]

,

Carol T. Zamfirescu

Discret. Appl. Math., 2020

Pairs and triples of forbidden subgraphs and the existence of a 2-factor.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 2019

The Matching Extendability of Optimal 1-Planar Graphs.

[BibT_eX]

[DOI]

,

Keita Segawa

,

Yusuke Suzuki

Graphs Comb., 2018

Edge proximity and matching extension in punctured planar triangulations.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2017

Forbidden Pairs with a Common Graph Generating Almost the Same Sets.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2017

Edge Proximity Conditions for Extendability in Planar Triangulations.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2015

Perfect matchings avoiding prescribed edges in a star-free graph.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2015

Forbidden Triples Generating a Finite set of 3-Connected Graphs.

[BibT_eX]

[DOI]

,

,

,

,

Electron. J. Comb., 2015

Distance-Restricted Matching Extension in Triangulations of the Torus and the Klein Bottle.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2014

Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

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

[BibT_eX]

[DOI]

,

Atsuhiro Nakamoto

,

Kenta Ozeki

J. Comb. Theory, Ser. B, 2013

Forbidden subgraphs generating a finite set.

[BibT_eX]

[DOI]

,

Michael D. Plummer

,

Discret. Math., 2013

Maximal K3's and Hamiltonicity of 4-connected claw-free graphs.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2012

Long cycles in unbalanced bipartite graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2012

A Pair of Forbidden Subgraphs and 2-Factors.

[BibT_eX]

[DOI]

,

Comb. Probab. Comput., 2012

The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity.

[BibT_eX]

[DOI]

,

,

,

,

J. Graph Theory, 2011

Closure for spanning trees and distant area.

[BibT_eX]

[DOI]

,

,

Ingo Schiermeyer

Discuss. Math. Graph Theory, 2011

Forbidden induced subgraphs for star-free graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2011

A pair of forbidden subgraphs and perfect matchings in graphs of high connectivity.

[BibT_eX]

[DOI]

,

,

,

,

Comb., 2011

Forbidden subgraphs and the existence of a 2-factor.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 2010

Degree Bounded Spanning Trees.

[BibT_eX]

[DOI]

,

Hajime Matsumura

,

Graphs Comb., 2010

Weighted degrees and heavy cycles in weighted graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

lambda-backbone colorings along pairwise disjoint stars and matchings.

[BibT_eX]

[DOI]

,

,

,

,

,

Discret. Math., 2009

Fan-type theorem for a long path passing through a specified vertex.

[BibT_eX]

,

Ars Comb., 2009

Two forbidden subgraphs and the existence of a 2-factor in graphs.

[BibT_eX]

[DOI]

,

,

Australas. J Comb., 2009

Cycles passing through k + 1 vertices in k-connected graphs.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2008

A degree sum condition for long cycles passing through a linear forest.

[BibT_eX]

[DOI]

,

Discret. Math., 2008

Degree conditions on claws and modified claws for hamiltonicity of graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2008

Forbidden subgraphs and the existence of paths and cycles passing through specified vertices.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2008

A note on the 2-domination number of a tree.

[BibT_eX]

[DOI]

,

,

,

,

,

Australas. J Comb., 2008

The upper bound of the number of cycles in a 2-factor of a line graph.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 2007

Heavy fans, cycles and paths in weighted graphs of large connectivity.

[BibT_eX]

[DOI]

Discret. Math., 2007

Weighted Ramsey problem.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2006

Heavy cycles passing through some specified vertices in weighted graphs.

[BibT_eX]

[DOI]

,

Kiyoshi Yoshimoto

,

Shenggui Zhang

J. Graph Theory, 2005

Claw Conditions for Heavy Cycles in Weighted Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2005

Heavy cycles in weighted graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Ore-type degree condition for heavy paths in weighted graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2005

A sk type condition for heavy cycles in weighted graphs.

[BibT_eX]

,

,