A note on dominating cycles in tough graphs
Saito, Akira; Yamashita, Tomoki
Ars Comb. 69, 3-8 (2003).
New families of sequential graphs
Wu, Shung-Liang
Ars Comb. 69, 9-17 (2003).
The height distribution of nodes in non-crossing trees
Panholzer, Alois
Ars Comb. 69, 19-32 (2003).
A hierarchy of classes of bounded bitolerance orders
Isaak, Garth; Nyman, Kathryn L.; Trenk, Ann T.
Ars Comb. 69, 33-53 (2003).
Complete bipartite free graphs
Cera, M.; Diánez, A.; García-Vázquez, P.; Valenzuela, J. C.
Ars Comb. 69, 55-64 (2003).
The frequency of summands of a particular size in palindromic compositions
Chinn, Phyllis; Grimaldi, Ralph; Heubach, Silvia
Ars Comb. 69, 65-78 (2003).
On equivalence of Hadamard matrices and projection properties
Georgiou, S.; Koukouvinos, C.
Ars Comb. 69, 79-95 (2003).
Application of upper and lower bounds for the domination number to Vizing’s conjecture
Clark, W. Edwin; Ismail, Mourad E. H.; Suen, Stephen
Ars Comb. 69, 97-108 (2003).
On Motzkin words and noncrossing partitions
Panayotolpoulos, A.; Sapounakis, A.
Ars Comb. 69, 109-116 (2003).
Vertex-magic total labelings of complete bipartite graphs
Gray, I. D.; MacDougall, J. A.; Simpson, R. J.; Wallis, W. D.
Ars Comb. 69, 117-127 (2003).
On the Hamiltonian decomposition of special product of graphs
Jaradat, M. M.
Ars Comb. 69, 129-141 (2003).
Parity results for p-regular partitions with distinct parts
Sellers, James A.
Ars Comb. 69, 143-146 (2003).
Average lower independence in trees and outerplanar graphs
Bau, Sheng; Henning, Michael A.; Dankelmann, Peter
Ars Comb. 69, 147-159 (2003).
A note on the decomposition dimension of complete graphs
Nakamigawa, Tomoki
Ars Comb. 69, 161-163 (2003).
A run-length operator on partitions of integers, applied to inventory chains
Kimberling, Clark
Ars Comb. 69, 165-175 (2003).
Circulant distant two labeling and circular chromatic number
Liu, Daphne Der-Fen; Zhu, Xuding
Ars Comb. 69, 177-183 (2003).
Improved knight coverings
Rubin, Frank
Ars Comb. 69, 185-196 (2003).
More on exact bicoverings of 12 points
Grannell, M. J.; Griggs, T. S.; Quinn, K. A. S.; Maenhaut, B. M.; Stanton, R. G.
Ars Comb. 69, 197-213 (2003).
Algebraic connectivity of the line graph, the middle graph and the total graph of a regular graph
Nihei, Masakazu
Ars Comb. 69, 215-221 (2003).
To determine 1-extendable graphs and their algorithms
Lou, Dingjun; Saito, Akira; Teng, Lihua
Ars Comb. 69, 223-228 (2003).
Upper bounds on signed 2-independence number of graphs
Shan, Erfang; Sohn, Moo Young; Kang, Liying
Ars Comb. 69, 229-239 (2003).
Φ-strong (weak) domination in a graph
Swaminathan, V.; Thangaraju, P.
Ars Comb. 69, 241-248 (2003).
Triangle-free regular graphs as an extremal family
Roblee, K. J.
Ars Comb. 69, 249-253 (2003).
On the n×n knight cover problem
Fisher, David C.
Ars Comb. 69, 255-274 (2003).
Minimum degree growth of the iterated line graph
Hartke, Stephen G.; Higgins, Aparna W.
Ars Comb. 69, 275-283 (2003).
A note on multicolor bipartite Ramsey numbers for K2,n
Laber, E. S.; Monte Carmelo, E. L.
Ars Comb. 69, 285-288 (2003).
Steiner triple systems with automorphism type
Minic, Michael; Calahan Zijlstra, R.
Ars Comb. 69, 289-300 (2003).
On some parameters related to uniquely vertex-colourable graphs and defining sets
Daneshgar, Amir; Naserasr, Reza
Ars Comb. 69, 301-318 (2003).
