3 citations · 5 across the 5 of their papers we have counts for
7 papers
On Edge-Partitioning of Complete Geometric Graphs into Plane Trees
Hazim Michman Trao, Gek L. Chia, Niran Abbas Ali +1
In response to a well-known open question ``Does every complete geometric graph on $2n\/$ vertices have a partition of its edge set into $n\/$ plane spanning trees?" we provide an…
Revisiting the Hamiltonian Theme in the Square of a Block: The General Case
Herbert Fleischner, Gek L. Chia
This is the second part of joint research in which we show that every -connected graph has the property. That is, given distinct , ,…
A Proof Technique for Skewness of Graphs
Gek L. Chia, Chan L. Lee, Yan Hao Ling
The skewness of a graph G is the minimum number of edges in G whose removal results in a planar graph. By appropriately introducing a weight to each edge of a graph, we determine,…
Revisiting the Hamiltonian Theme in the Square of a Block: The Case of DT-Graphs
Gek L. Chia, Jan Ekstein, Herbert Fleischner
The square of a graph G, denoted G^2, is the graph obtained from G by joining by an edge any two nonadjacent vertices which have a common neighbor. A graph G is said to have the F_…
Triangulability of Convex Graphs and Convex Skewness
Niran Abbas Ali, Gek L. Chia, Hazim Michman Trao +1
Motivated by a result of [1] which states that if F is a subgraph of a convex complete graph K_n and F contains no boundary edge of K_n and |E(F)| \leq n-3, then K_n - F admits a t…
Non-Crossing Perfect Matchings and Triangle-Free Geometric Graphs
Hazim Michman Trao, Gek L. Chia, Niran Abbas Ali +1
We study extremal type problem arising from the question: What is the maximum number of edge-disjoint non-crossing perfect matchings on a set S of 2n points in the plane such that…