|
|
||
|
Research Problem Websites |
|
|
|
Open Problems |
|
|
|
|
|
|
|
|
||
|
Kluwer Academic Publishers,
Vol. 3 of Network Theory and Applications, (2000), (ISBN: 0-7923-6469-4) |
|
|
Chinese Higher Education Press, (2002), (ISBN: 7-04-010563-2) |
|
|
|
|
|
|
|
|
|
Recent Publications: |
|
|
|
|
|
European J. Combin.
29
(2008),
no.
1, 298--310 |
|
|
|
|
|
Discrete Math., 307 (2007) 3076-3080. |
|
|
Combinatorica, 27 (2007) 245-246. |
|
|
AMS/IP Studies in Advanced Mathematics, 39 (2007), 149-159. |
|
|
Discrete Math. 307
(2007) 1205-1211. |
|
|
Discrete Math, 306 (2006) 2115-2117. Discrete Math, 307 (2007) 1217. |
|
|
J. of Combinatorial Math. And Combinatorial Computing, 59 (2006), 165--171. 05C45 |
|
|
Discrete Mathematics, 306 (2006) 1997-2004. |
|
|
Every 3-connected, essentially 11-connected line graph is hamiltonian |
J. Combinatorial Theory, Ser. B, 96 (2006)
571-576. |
|
J. Combinatorial Theory, Ser. B, 96 (2006)
493-504. |
|
|
Europ. J. Combinatorics, 27 (2006), 436-443. |
|
|
J. Graph Theory, 52 (2006) 51-72. |
|
|
Graphs and Combinatorics, 21 (2005)
469-474. |
|
|
J. Graph Theory, 49 (2005) 196-204. |
|
|
Ars
Combinatoria, 75 (2005), 313-331. |
|
|
J. Graph Theory 48 (2005), no.
2, 142--146. |
|
|
Discrete Applied Math 145 (2005) 422-428. |
|
|
|
|
|
|
|
|
Recently Accepted Publications |
|
|
|
|
|
Obtaining
a uniformly dense graph from a non-uniformly dense graph |
Discrete Applied. Math |
|
Discrete Math |
|
|
On s-hamiltonian-connected
line graphs |
Discrete Math, |
|
Hamilton-Connected Indices of Graphs |
Discrete Math, |
|
Discrete Math, |
|
|
Discrete Math, |
|
|
Ars Combinatoria |
|
|
Spanning eulerian subgraphs in $N^2$-locally connected claw-free graphs |
Ars Combinatoria |
|
Europ. J. Combinatorics |
|
|
Ars Combinatoria |
|
|
Ars Combinatoria |
|
|
New Sufficient Conditions for
s-Hamiltonian Graphs and s-Hamiltonian Connected Graphs |
Ars Combinatoria |
J. Combinatorial Theory, Ser. B |
|
J. Combinatorial Theory, Ser. B |
|
|
|
|
|
|
|
|
Current Research (Preprints) |
|
|
Cycles and Eulerian Subgraphs |
|
|
Every
3-connected claw-free $Z_8$-free graph is hamiltonian |
The
Chvatal-Erdos condition for supereulerian
graphs and the hamiltonian index |
|
|
|
|
|
|
|
Flows and Cycle Covers, Graph Coloring and its Generalizations |
|
|
Degree Conditions for Group Connectivity |
|
|
|
|
|
|
|
|
Uniformly Dense Graphs |
|
|
|
|
|
|
|
|
Applications of Mathematics |
|
|
Energy
Management System with Automatic Reconfigurationfor
Electric Shipboard Power Systems |
Proceedings, Reconfiguration and Survivability
Symposium 2005, |
|
Distributed Control Agents Approach to Energy
Management In Electric Shipboard Power Systems |
IEEE PES General Meeting, June 18-22,
2006, Montral, |
|
Distributed Approaches for Determinations of
Reconfiguration Algorithm Termination |
Proceedings of the Electric Ship
Technologies Symposium (ESTS) 2007, |
|
The Journal of Applied Gerontology, 26
(2007) 258-273. |
|
|
|
|
|
|
|
|
|
|
|
|
|
2