About
Contact & Profiles
A5111298290
Research Areas
- Graph Labeling and Dimension Problems
- Advanced Graph Theory Research
- Computational Geometry and Mesh Generation
- graph theory and CDMA systems
- Complexity and Algorithms in Graphs
- Cryptography and Data Security
- Graph Theory and Algorithms
Universiti Tunku Abdul Rahman
2024
10.1016/j.tcs.2025.115180
article
EN
Theoretical Computer Science
2025-03-01
The skewness of a graph is the minimum number its edges whose deletion results in planar graph. We determine orders cubic graphs with girth no more than 6 and 4. In passing, we also all cages 8.
10.1051/itmconf/20246701028
article
EN
cc-by
ITM Web of Conferences
2024-01-01
By the skewness of a graph, we mean minimum number its edges whose deletion results in planar graph. We determine large family cubic bipartite graphs (which includes Heawood graph as special case). Moreover, also those classes these which are π-skew resulting plane (upon deleting right edges) hexagulations.
10.1080/09728600.2024.2441817
article
EN
cc-by
AKCE International Journal of Graphs and Combinatorics
2024-12-26
Coming Soon ...