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...
| Main Authors: | , , |
|---|---|
| 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 |