Volume 210, (2011)

Research Article

Counting mutations and anti-chains in complete binary trees

Salaam, Lifoma; Shapiro, Louis

Congr. Numer. 210, 5-20 (2011).

Research Article

The maximum rectilinear crossing number of the wheel graph

Feder, Elie

Congr. Numer. 210, 21-32 (2011).

Research Article

The distribution of certain combinatorial arrays

Clark, Lane; Dabab, Yahya

Congr. Numer. 210, 33-39 (2011).

Research Article

A note on the optimal condition matching preclusion sets for twisted cubes

Chen, Allen; Cheng, Eddie; He, Rolland; Liang, Mason; Wang, Kevin

Congr. Numer. 210, 41-56 (2011).

Research Article

Planar α-overlap graphs

Godbole, Anant P.; Knisley, Debra; Norwood, Rick

Congr. Numer. 210, 57-59 (2011).

Research Article

Matching preclusion and conditional matching preclusion problems for the generalized Petersen graph P(n,3)

Cheng, Eddie; Lipták, László; Prince, Nathaniel; Stanton, Kristine

Congr. Numer. 210, 61-72 (2011).

Research Article

Further contributions to balanced arrays of strength seven with applications

Chopra, D. V.; Low, Richard M.; Dios, R.

Congr. Numer. 210, 73-78 (2011).

Research Article

Distances in Kneser graphs

Clark, Lane; Johnson, Darin

Congr. Numer. 210, 79-85 (2011).

Research Article

Monochromatic-rainbow Ramsey numbers with a specified number of colors

Fujie-Okamoto, Futaba; Jones, Ryan; Kolasinski, Kyle; Zhang, Ping

Congr. Numer. 210, 87-103 (2011).

Research Article

An eight-tuple construction of the Clifford algebra G3

Myers, Timothy

Congr. Numer. 210, 105-117 (2011).

Research Article

Constrained rerouting in networks: an integer programming formulation

Weyerman, W.; Durtschi, B.; Bhandari, R.

Congr. Numer. 210, 119-138 (2011).

Research Article

A breadth-first search with betweenness

Kaneko, Yoshihiro

Congr. Numer. 210, 139-150 (2011).

Research Article

On super edge-graceful trees of diameter four

Krop, Elliot; Mutiso, Fedelis; Raridan, Christopher

Congr. Numer. 210, 151-167 (2011).

Research Article

On the graphs whose L(2,1)-span is the same as their inh L(2,1)-span

Held, Ryan; Jacob, Jobby

Congr. Numer. 210, 169-179 (2011).

Research Article

Which graphs are modular k-colorable?

Jones, Ryan; Kolasinski, Kyle; Zhang, Ping

Congr. Numer. 210, 181-191 (2011).

Research Article

A quantum algorithm approach for multivariate cryptosystems

Tran, Hoa

Congr. Numer. 210, 193-198 (2011).

Research Article

Sequences of matchings in path-type graphs

Holliday, Sarah; Krop Elliot

Congr. Numer. 210, 199-203 (2011).

E-mail Alert

Add your e-mail address to receive upcoming issues of Congressus Numerantium

Special Issues

The Combinatorial Press Editorial Office routinely extends invitations to scholars for the guest editing of Special Issues, focusing on topics of interest to the scientific community. We actively encourage proposals from our readers and authors, directly submitted to us, encompassing subjects within their respective fields of expertise. The Editorial Team, in conjunction with the Editor-in-Chief, will supervise the appointment of Guest Editors and scrutinize Special Issue proposals to ensure content relevance and appropriateness for the journal. To propose a Special Issue, kindly complete all required information for submission;