The following pages link to I. Nengah Suparta (Q941338):
Displaying 11 items.
- A construction of Gray codes inducing complete graphs (Q941339) (← links)
- On face irregular evaluations of plane graphs (Q2118244) (← links)
- A simple proof for the existence of exponentially balanced Gray codes (Q2571312) (← links)
- On the construction of linear \(q\)-ary lexicodes. (Q2572975) (← links)
- Balanced Maximum Counting Sequences (Q3547995) (← links)
- The separability of standard cyclic N-ary Gray codes (Q4679924) (← links)
- Expanding graceful trees (Q4957986) (← links)
- Some classes of bipartite graphs induced by Gray codes (Q5006626) (← links)
- (Q5715090) (← links)
- Modular irregularity strength of dense graphs (Q6571568) (← links)
- Graceful chromatic number of some Cartesian product graphs (Q6573645) (← links)
