| Publication | Date of Publication | Type |
|---|
Spanning even trees of graphs
Journal of Graph Theory | 2024-08-30 | Paper |
Edge‐colored complete graphs without properly colored even cycles: A full characterization
Journal of Graph Theory | 2023-10-04 | Paper |
On connectivities of edge-colored graphs
Discrete Applied Mathematics | 2022-12-08 | Paper |
Disjoint properly colored cycles in edge-colored complete bipartite graphs
Discrete Mathematics | 2022-11-02 | Paper |
A complete bipartite graph without properly colored cycles of length four
Journal of Graph Theory | 2020-05-21 | Paper |
Pairs of forbidden subgraphs and 2-connected supereulerian graphs
Discrete Mathematics | 2018-04-19 | Paper |
A Hamilton cycle in which specified vertices are located in polar opposite
Journal of Combinatorics | 2018-01-15 | Paper |
A panconnectivity theorem for bipartite graphs
Discrete Mathematics | 2017-10-24 | Paper |
On dominating even subgraphs in cubic graphs
SIAM Journal on Discrete Mathematics | 2017-05-24 | Paper |
Vertex coloring of graphs by total 2-weightings
Graphs and Combinatorics | 2017-01-13 | Paper |
| Hamiltonian cycles of certain kinds of graphs satisfying Dirac condition | 2016-07-01 | Paper |
| A 4-cycle and a 2-factor with two components of a graph satisfying the Chvátal-Erdős condition | 2016-07-01 | Paper |
Locating sets of vertices on Hamiltonian cycles
Discrete Applied Mathematics | 2016-06-21 | Paper |
On spanning trees with restricted degrees
Information Processing Letters | 2016-06-16 | Paper |
Locating pairs of vertices on a Hamiltonian cycle in bigraphs
Graphs and Combinatorics | 2016-06-09 | Paper |
Rainbow cycles in edge-colored graphs
Discrete Mathematics | 2016-01-21 | Paper |
A relationship between Thomassen's conjecture and Bondy's conjecture
SIAM Journal on Discrete Mathematics | 2015-11-27 | Paper |
| An extremal problem resulting in many paths. | 2015-10-27 | Paper |
Equivalence of Jackson's and Thomassen's conjectures
Journal of Combinatorial Theory. Series B | 2015-06-22 | Paper |
2-factors with bounded number of components in claw-free graphs
Discrete Mathematics | 2015-01-30 | Paper |
2-factors in claw-free graphs with lower bounds cycle lengths
Graphs and Combinatorics | 2015-01-20 | Paper |
Note on locating pairs of vertices on Hamiltonian cycles
Graphs and Combinatorics | 2014-09-19 | Paper |
| 2-factors in claw-free graphs | 2013-11-01 | Paper |
\(\{4,5\}\) is not coverable: a counterexample to a conjecture of Kaiser and Škrekovski
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
Claw-free graphs and 2-factors that separate independent vertices
Journal of Graph Theory | 2012-06-13 | Paper |
2-factors and independent sets on claw-free graphs
Discrete Mathematics | 2012-01-11 | Paper |
Set-orderedness as a generalization of \(k\)-orderedness and cyclability
Discrete Mathematics | 2010-10-11 | Paper |
| scientific article; zbMATH DE number 5717198 (Why is no real title available?) | 2010-06-07 | Paper |
Closure concept for 2-factors in claw-free graphs
Discrete Mathematics | 2010-05-05 | Paper |
Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs
Graphs and Combinatorics | 2010-01-18 | Paper |
Spanning even subgraphs of 3‐edge‐connected graphs
Journal of Graph Theory | 2009-12-18 | Paper |
\(\lambda \)-backbone colorings along pairwise disjoint stars and matchings
Discrete Mathematics | 2009-12-15 | Paper |
On components of 2-factors in claw-free graphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Edge degrees and dominating cycles
Discrete Mathematics | 2008-05-13 | Paper |
On a spanning tree with specified leaves
Graphs and Combinatorics | 2008-04-16 | Paper |
Cycles through specified vertices in triangle-free graphs
Discussiones Mathematicae Graph Theory | 2008-02-22 | Paper |
Relative length of longest paths and longest cycles in triangle-free graphs
Discrete Mathematics | 2008-02-11 | Paper |
On the number of components in 2-factors of claw-free graphs
Discrete Mathematics | 2007-11-27 | Paper |
Even subgraphs of bridgeless graphs and 2-factors of line graphs
Discrete Mathematics | 2007-11-27 | Paper |
The upper bound of the number of cycles in a 2-factor of a line graph
Journal of Graph Theory | 2007-06-11 | Paper |
| scientific article; zbMATH DE number 5145367 (Why is no real title available?) | 2007-04-23 | Paper |
Toughness and Hamiltonicity in \(k\)-trees
Discrete Mathematics | 2007-03-02 | Paper |
| scientific article; zbMATH DE number 2188449 (Why is no real title available?) | 2005-07-26 | Paper |
| scientific article; zbMATH DE number 2188342 (Why is no real title available?) | 2005-07-26 | Paper |
| scientific article; zbMATH DE number 2188327 (Why is no real title available?) | 2005-07-26 | Paper |
Heavy cycles passing through some specified vertices in weighted graphs
Journal of Graph Theory | 2005-06-30 | Paper |
ALTERNATING HAMILTON CYCLES WITH MINIMUM NUMBER OF CROSSINGS IN THE PLANE
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
A 2‐factor with two components of a graph satisfying the Chvátal‐Erdös condition
Journal of Graph Theory | 2003-08-20 | Paper |
On a Hamiltonian cycle in which specified vertices are uniformly distributed
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
On a 2-factor with a specified edge in a graph satisfying the Ore condition
Discrete Mathematics | 2002-12-02 | Paper |
On a Hamiltonian cycle in which specified vertices are not isolated
Discrete Mathematics | 2002-12-02 | Paper |
On geometric independency trees for points in the plane
Discrete Mathematics | 2002-12-02 | Paper |
The connectivities of leaf graphs of sets of points in the plane
Tokyo Journal of Mathematics | 2002-05-22 | Paper |
The connectivities of leaf graphs of 2-connected graphs
Journal of Combinatorial Theory. Series B | 1999-12-20 | Paper |
