Restricted triangulation on circulant graphs
The restricted triangulation existence problem on a given graph decides whether there exists a triangulation on the graph’s vertex set that is restricted with respect to its edge set. Let G = C ( n , S ) be a circulant graph on n vertices with jump value set S . We consider the restricted triangulat...
Saved in:
Main Authors: | Ali, Niran Abbas, Kilicman, Adem, Trao, Hazim Michman |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2018
|
Online Access: | http://psasir.upm.edu.my/id/eprint/73782/1/Restricted%20triangulation%20on%20circulant%20graphs.pdf http://psasir.upm.edu.my/id/eprint/73782/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Triangulability of convex graphs and convex skewness
by: Ali, Niran Abbas, et al.
Published: (2021) -
Packing 1-plane Hamiltonian cycles in complete geometric graphs
by: Trao, Hazim Michman, et al.
Published: (2019) -
On some packing and partition problems in geometric graphs
by: Trao, Hazim Michman
Published: (2018) -
G-angulability of convex geometric graphs
by: al-Hakeem, Niran Abbas Ali
Published: (2018) -
Topological spaces associated with simple graphs
by: Kilicman, Adem, et al.
Published: (2018)