Sufficient conditions for graphs to be maximally 4-restricted edge connected

- Wang, Mujiangshan, Lin, Yuqing, Wang, Shiying, Wang, Miyu

On the energy of certain recursive structures

- Stephen, Sudeep, Rajan, Bharati, Miller, Mirka, Grigorious, Cyriac, William, Albert

Examining word association networks: a cross-country comparison of women's perceptions of HPV testing and vaccination

- Schmid, Bernd C., Carlson, Jamie, Rezniczek, Günther A., Wyllie, Jessica, Jaaback, Kenneth, Vencovsky, Filip

Cumulative signal transmission in nonlinear reaction-diffusion networks

- Oyarzun, Diego A., Lopez-Caamal, Fernando, Garcia, Miriam R., Middleton, Richard H., Weisse, Andrea Y.

Advances in the degree/diameter problem

- Miller, Mirka

Characterisation of graphs with exclusive sum labelling

- Miller, Mirka, Ryan, Joe, Ryjáček, Zdeněk

Strong edge-magic graphs of maximum size

- MacDougall, James A., Wallis, W. D.

All regular graphs of small odd order are vertex-magic

- Kimberley, Jason S., MacDougall, James A.

An algorithm for the optimization of multiple classifiers in data mining based on graphs

- Kelarev, Andrei, Ryan, Joe, Yearwood, John

Degree diameter problem on triangular networks

- Holub, Přemysl, Ryan, Joe

Resolvability of graphs

- Grigorious, Cyriac

Vertex-magic labelings: mutations

- Gray, I. D., MacDougall, James A.

Vertex-magic labeling of regular graphs: disjoint unions and assemblages

- Gray, I. D., MacDougall, J. A.

Sparse semi-magic squares and vertex-magic labelings

- Gray, I. D., MacDougall, James A.

Large interconnection networks with given degree and diameter

- Feria Puron, Ramiro

Graph-based data clustering with overlaps

- Fellows, Michael R., Guo, Jiong, Komusiewicz, Christian, Niedermeier, Rolf, Uhlmann, Joannes

A complexity dichotomy for finding disjoint solutions of vertex deletion problems

- Fellows, Michael R., Guo, Jiong, Moser, Hannes, Niedermeier, Rolf

Leaf powers and their properties: using the trees

- Fellows, Michael R., Meister, Daniel, Rosamond, Frances A., Sritharan, R., Telle, Jan Arne

What makes equitable connected partition easy

- Enciso, Rosa, Fellows, Michael R., Guo, Jiong, Kanj, Iyad, Rosamond, Frances, Ondrej, Suchy

On free products of graphs

- Carter, Max, Tornier, Stephan, Willis, George