Volume 227, (2016)

Research Article

Realizability of n-vertex graphs with prescribed vertex connectivity, edge connectivity, minimum degree, and maximum degree. III

Dymáček, Wayne M.; Sears, Lewis IV

Congr. Numer. 227, 5-25 (2016).

Research Article

Sum list colorings of small graphs

Kemnitz, Arnfried; Marangio, Massimiliano; Voigt, Margit

Congr. Numer. 227, 27-50 (2016).

Research Article

Bounds for topological indices of molecular graphs

Vaidya, Sanju; Surendran, Geetha

Congr. Numer. 227, 51-64 (2016).

Research Article

On reliability models associated with the edge domination number for trees

Gross, D.; Heinig, M.; Saccoman, J. T.; Suffel, C.; Yatauro, M.

Congr. Numer. 227, 65-83 (2016).

Research Article

Erdős-Turán type numbers for cube graphs

Harborth, Heiko; Nienborg, Hauke

Congr. Numer. 227, 85-90 (2016).

Research Article

On some properties of Tribonacci-type polynomials

Durbin, Alexander; Sears, Huei; Zeleke, Aklilu

Congr. Numer. 227, 91-99 (2016).

Research Article

Palindromes with forbidden substrings

Grimaldi, Ralph P.; Stevens, Gary E.

Congr. Numer. 227, 101-130 (2016).

Research Article

A generalization of Edgesum problem

Moghadam, Hosien Said

Congr. Numer. 227, 131-137 (2016).

Research Article

Trees for given values of the span, caps and Icaps for L(2,1)-colorings

Fogel, K.; Villalpando, J.; Coufal, V.; Ray, R.; Yerion, K.; Higgins, A.; Higgins, W.

Congr. Numer. 227, 139-155 (2016).

Research Article

Rigorous bounds relating bond percolation thresholds of two three-dimensional lattices

Wierman, John C.; Yu, Gaoran

Congr. Numer. 227, 157-176 (2016).

Research Article

On a conjecture of Levit and Mandrescu

Kahl, Nathan; Quense, Hannah; Wager, Tara

Congr. Numer. 227, 177-185 (2016).

Research Article

Best monotone degree condition for 1-binding graphs to contain a 1-factor

Bauer, D.; Nevo, A.; Schmeichel, E.

Congr. Numer. 227, 187-195 (2016).

Research Article

Degrees of Menger and Sierpinski graphs

Bickle, Allan

Congr. Numer. 227, 197-208 (2016).

Research Article

A note on the Skewness of a graph

Pinciu, Val; Soss, William

Congr. Numer. 227, 209-214 (2016).

Research Article

2-upper bound graphs and numbers

Kawatani, Gen

Congr. Numer. 227, 215-220 (2016).

Research Article

Parallel moves in Hanoi games on graphs: every parallel Hanoi graph is a sequential Hanoi graph

Leiss, Ernst L.; Mackey, Isaac

Congr. Numer. 227, 221-229 (2016).

Research Article

Split domination, independence, and irredundance in graphs

Hedetniemi, Stephen; Knoll, Fiona; Laskar, Renu

Congr. Numer. 227, 231-239 (2016).

Research Article

Rainbow partitions and rainbow polynomial

Dod, Markus; Kischnick, Sara; Tittmann, Peter

Congr. Numer. 227, 241-255 (2016).

Research Article

Edge rotations in graphs on the sphere

Matsumoto, Naoki

Congr. Numer. 227, 257-267 (2016).

Research Article

On extending Hansel’s theorem to hypergraphs

Churchill, Gregory; Nagle, Brendan

Congr. Numer. 227, 269-275 (2016).

Research Article

Regular incomplete tournaments with handicap two

Froncek, Dalibor

Congr. Numer. 227, 277-285 (2016).

Research Article

The ratio of domination and independent domination numbers on trees

Wang, Shaohui; Wei, Bing

Congr. Numer. 227, 287-292 (2016).

Research Article

Connectivity parameters of graphs

Hedetniemi, Stephen T.; Laskar, Renu C.

Congr. Numer. 227, 293-308 (2016).

Research Article

Some construction of cluttered orderings for the complete bipartite graph

Adachi, Tomoko

Congr. Numer. 227, 309-323 (2016).

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;