Two families of graphs that are not CCE-orientable
Fisher, David C.; Kim, Suh-Ryung; Park, Chang Hoon; Nam, Yunsun
Ars Comb. 58, 3-12 (2001).
On exact \(n\)-step domination
Williams, Lauren K.
Ars Comb. 58, 13-22 (2001).
Multipartite Ramsey numbers
Day, David; Goddard, Wayne; Henning, Michael A.; Swart, Henda C.
Ars Comb. 58, 23-31 (2001).
Long paths and cycles through specified vertices in \(k\)-connected graphs
Sakai, Toshinori
Ars Comb. 58, 33-65 (2001).
Weak clique-covering cycles and paths
Chen, G.; Faudree, R. J.; Shreve, W. E.
Ars Comb. 58, 67-83 (2001).
Using thresholds to compute chromatic polynomials
Haggard, Gary; Mathies, Thomas R.
Ars Comb. 58, 85-95 (2001).
A space-filling complete graph
Ginsburg, J.; Linek, V.
Ars Comb. 58, 97-109 (2001).
On a characterization of balanced matroids
Corp, Jenifer; McNulty, Jennifer
Ars Comb. 58, 111-112 (2001).
Bounding the roots of independence polynomials
Brown, J. I.; Nowakowski, R. J.
Ars Comb. 58, 113-120 (2001).
Linear vertex arboricity, independence number and clique cover number
Che Bor Lam, Peter; Chee Shiu, Wai; Sun, Feng; Wang, Jianfang; Yan, Guiying
Ars Comb. 58, 121-128 (2001).
Small \(2\)-factors of bipartite graphs
Horák, P.; Bertram, E.; Mohammed, S.
Ars Comb. 58, 129-146 (2001).
Special kinds of domination parameters of edge-deleted graphs
Kwasnik, Maria; Zwierzchowski, Maciej
Ars Comb. 58, 147-160 (2001).
Path spectra and forbidden families
Fuller, Allen G.; Gould, Ronald J.
Ars Comb. 58, 161-167 (2001).
A note on choosability with separation for planar graphs
Škrekovski, Riste
Ars Comb. 58, 169-174 (2001).
Minimum average broadcast time in a graph of bounded degree
Pensaert, William
Ars Comb. 58, 175-181 (2001).
A new perspective on the union-closed sets conjecture
Dohmen, Klaus
Ars Comb. 58, 183-185 (2001).
A combinatorial structure of affine \((\alpha_{1},…,\alpha_{t})\)-resolvable \((r,\lambda)\)-designs
Kageyama, Sanpei; Shimata, Tsutomu
Ars Comb. 58, 187-192 (2001).
Cycles containing given subsets in 1-tough graphs
Li, Jianping; Shen, Ruqun; Tian, Feng
Ars Comb. 58, 193-204 (2001).
On the Lucas matrix of order \(2^{k}\) sequence \(\{L_n^{(2^k)}\}\)
Zhang, Cheng-heng
Ars Comb. 58, 205-214 (2001).
On the connectivity of generalized p-cycles
Pelayo, I.; Balbuena, C.; Gómez, J.
Ars Comb. 58, 215-231 (2001).
A new distance measure between graphs
Gavlas, Heather
Ars Comb. 58, 233-244 (2001).
Minimum length of cycles through specified vertices in graphs with wide-diameter at most \(d\)
Kojima, Toru; Ando, Kiyoshi
Ars Comb. 58, 245-256 (2001).
A computer program for obtaining subsystems
Can, Himmet; Hawkins, Lee
Ars Comb. 58, 257-269 (2001).
Spanning multipartite tournaments of semicomplete multipartite digraphs
Volkmann, Lutz
Ars Comb. 58, 271-278 (2001).
K-dominating sets of \(P_{2k}+2\times P_{n}\) and \(P_{m}\times P_{n}\)
Klobucar, Antoaneta
Ars Comb. 58, 279-288 (2001).
On \(k\)-arcs covering a line in finite projective planes
Ng, Siaw-Lynn; Wild, Peter R.
Ars Comb. 58, 289-300 (2001).
On quadrilaterals and cycle covers in a bipartite graph
Wang, Hong
Ars Comb. 58, 301-311 (2001).
On McLeish’s construction for Latin squares without intercalates
Wanless, I. M.
Ars Comb. 58, 313-317 (2001).
