bio | website | turkistany.blogspot.com |
---|---|---|
location | Makkah, Saudi Arabia | |
age | 43 | |
visits | member for | 3 years, 8 months |
seen | Mar 29 at 23:34 | |
stats | profile views | 727 |
Wild Florida Gator living in Arabia
Mohammad Al-Turkistany, Ph.D. in Computer Engineering, University of Florida
Assistant Professor of Computer Engineering, Umm Al-Qura University, Makkah, Saudi Arabia
"The reasonable man adapts himself to the world; the unreasonable persists in trying to adapt the world to himself. Therefore all progress depends on the unreasonable".
George Bernard Shaw
"You can't turn mince back into meat by rotating the mincer's handle in the opposite direction"
Feb 6 |
revised |
Cubic graphs decompositions
corrected grammar |
Feb 3 |
comment |
Cubic graphs decompositions
@JosephO'Rourke Good idea. Are you aware of polynomial-time decomposition problem (of connected cubic graph) of type I mentioned in my motivation? |
Feb 3 |
revised |
Cubic graphs decompositions
added 365 characters in body |
Feb 3 |
revised |
Cubic graphs decompositions
added 106 characters in body |
Feb 2 |
revised |
Cubic graphs decompositions
added 2 characters in body; edited tags |
Feb 2 |
revised |
Cubic graphs decompositions
edited body |
Feb 2 |
revised |
Cubic graphs decompositions
edited body |
Feb 2 |
asked | Cubic graphs decompositions |
Feb 1 |
comment |
Partitioning a cubic graph into two induced cycles of equal order
@joro Can you explain more? |
Feb 1 |
comment |
Partitioning a cubic graph into two induced cycles of equal order
@joro Thanks for your valuable comments. I edited the post to clarify it. |
Feb 1 |
revised |
Partitioning a cubic graph into two induced cycles of equal order
added 590 characters in body |
Feb 1 |
comment |
Partitioning a cubic graph into two induced cycles of equal order
@joro They are not exactly the same. Cycle permutation graphs are highly connected cubic graph. I guess they are at least $V/2$-edge connected. Here, I am interested in hardness of recognition of cycle permutation graphs. I guess it is NP-complete. |
Jan 31 |
revised |
Partitioning a cubic graph into two induced cycles of equal order
added 191 characters in body |
Jan 31 |
revised |
Partitioning a cubic graph into two induced cycles of equal order
added 308 characters in body |
Jan 31 |
revised |
Partitioning a cubic graph into two induced cycles of equal order
added 308 characters in body |
Jan 31 |
asked | Partitioning a cubic graph into two induced cycles of equal order |
Jan 27 |
accepted | How dense is the set of asymmetric graphs? |
Jan 3 |
comment |
How dense is the set of asymmetric graphs?
Can you simplify the formula for the number of symmetric graphs and give tight asymptotic upper-bound? (such as $o(f(|V|))$) |
Jan 3 |
revised |
How dense is the set of asymmetric graphs?
added 271 characters in body |
Dec 18 |
comment |
Graph classes where Hamiltonian Cycle and Hamiltonian Path problems have different complexity
@MichalR.Przybylek I edited the question to restrict the scope and make it answerable |