On describing the incidence matrix of a finite projective plane via orthogonal Latin squares and via a digraph complete set of Latin squares
Levesque, Claude
J. Comb. Math. Comb. Comput. 65, 7-24 (2008).
On graphs of maximum degree 3 and defect 4
Pineda-Villavicencio, Guillermo; Miller, Mirka
J. Comb. Math. Comb. Comput. 65, 25-31 (2008).
How many graphs are super edge-magic? An asymptotic approach
Araujo, G.; Figueroa-Centeno, R. M.; Ichishima, R.; Muntaner-Batle, F. A.
J. Comb. Math. Comb. Comput. 65, 33-40 (2008).
On antimagic labelings of disjoint union of complete s-partite graphs
Dafik; Miller, Mirka; Ryan, Joe; Bača, Martin
J. Comb. Math. Comb. Comput. 65, 41-49 (2008).
On antimode graphs
Marshall, Kim; Ryan, Joe
J. Comb. Math. Comb. Comput. 65, 51-60 (2008).
Edge-antimagic total labeling of disjoint union of caterpillars
Bača, Martin; Miller, Mirka; Ryan, Joe; Dafik
J. Comb. Math. Comb. Comput. 65, 61-70 (2008).
On the connected partition dimension of unicyclic graphs
Javaid, Imran
J. Comb. Math. Comb. Comput. 65, 71-77 (2008).
Ramsey (K1,2,C4)-minimal graphs
Baskoro, Edy Tri; Yulianti, Lyra; Assiyatun, Hilda
J. Comb. Math. Comb. Comput. 65, 79-90 (2008).
Diagram-based verification of parameterized systems
Nugraheni, Cecilia E.
J. Comb. Math. Comb. Comput. 65, 91-102 (2008).
Total vertex irregular labelings of wheels, fans, suns and frienship graphs
Wijaya, Kristiana; Slamin
J. Comb. Math. Comb. Comput. 65, 103-112 (2008).
On the Ramsey numbers for a combination of paths and Jahangirs
Ali, Kashif; Baskoro, Edi Tri
J. Comb. Math. Comb. Comput. 65, 113-119 (2008).
Critical set of caterpillar graph for secret sharing scheme
Imron, Chairul; Setiyono, Budi; Simanjuntak, R.; Baskoro, Edy T.
J. Comb. Math. Comb. Comput. 65, 121-125 (2008).
Edge antimagic total labeling on paths and unicycles
Silaban, Denny R.; Sugeng, Kiki A.
J. Comb. Math. Comb. Comput. 65, 127-132 (2008).
Optimum sum labeling of finite union of sum graphs
Burhan, Helen; Rusin, Rahmi; Sugeng, Kiki A.
J. Comb. Math. Comb. Comput. 65, 133-138 (2008).
The metric dimension of graph with pendant edges
Iswadi, H.; Baskoro, E. T.; Simanjuntak, R.; Salman, A. N. M.
J. Comb. Math. Comb. Comput. 65, 139-145 (2008); corrections ibid. 87, 43-50 (2013).
New constructions of A-magic graphs using labeling matrices
Sugeng, Kiki A.; Miller, Mirka
J. Comb. Math. Comb. Comput. 65, 147-151 (2008).
The Ramsey numbers of large star and large star-like trees versus odd wheels
Surahmat; Baskoro, Edy Tri; Broersma, H. J.
J. Comb. Math. Comb. Comput. 65, 153-162 (2008).
The total edge-irregular strengths of the corona product of paths with some graphs
Nurdin; Salman, A. N. M.; Baskoro, E. T.
J. Comb. Math. Comb. Comput. 65, 163-175 (2008).
The computational complexity of λ-backbone colorings of graphs with n-complete backbones
Salman, A. N. M.
J. Comb. Math. Comb. Comput. 65, 177-180 (2008).
On multiplicative labelings of a graph
Hedge, S. M.
J. Comb. Math. Comb. Comput. 65, 181-195 (2008).
Ph-supermagic labelings of some trees
Maryati, T. K.; Baskoro, E. T.; Salman, A. N. M.
J. Comb. Math. Comb. Comput. 65, 197-204 (2008).
Magic digraphs
Bloom, G. S.; Marr, Alison; Wallis, W. D.
J. Comb. Math. Comb. Comput. 65, 205-212 (2008).
Selected papers of the international conference on graph theory and information security (ICGTIS 2007), Bandung, Indonesia, February 10–13, 2007. Dedicated to Mirka Miller on her 57th birthday.
Baskoro, E. T. (ed.); Ryan, J. (ed.); Salman, A. N. M. (ed.)
J. Comb. Math. Comb. Comput. 65, 1-212 (2008).
