 |
All regular graphs of small odd order are vertex-magic |
Kimberley, Jason S.; MacDougall, James A. |
2011 |
—
|
|
 |
Extremal networks and connectivity |
Marshall, Kim |
2011 |
—
|
|
 |
On graphs of defect at most 2 |
Feria-Purón, Ramiro; Miller, Mirka; Pineda-Villavicencio, Guillermo |
2011 |
—
|
|
 |
Strong VMTLs of odd order 2-regular graphs |
Kimberley, Jason S.; MacDougall, James A. |
2011 |
|
|
 |
Belief propagation as a dynamical system: the linear case and open problems |
Rüeffer, Bjöern S.; Kellett, Christopher M.; Dower, Peter M.; Weller, Steven R. |
2010 |
—
|
|
 |
Clustering with partial information |
Bodlaender, Hans L.; Fellows, Michael R.; Heggernes, Pinar; Mancini, Frederico; Papadopoulos, Charis... More
|
2010 |
—
|
|
 |
Integral trees of diameter 4 |
Mohr, Steve; MacDougall, Jim |
2010 |
—
|
|
 |
The parameterized complexity of some minimum label problems |
Fellows, Michael R.; Guo, Jiong; Kanj, Iyad |
2010 |
—
|
|
 |
Physical-model-based control of a piezoelectric tube for nano-scale positioning applications |
Gawthrop, P. J.; Bhikkaji, B.; Moheimani, S. O. R. |
2010 |
—
|
|
 |
Super d-antimagic labelings of disconnected plane graphs |
Bača, Martin; Miller, Mirka; Phanalasy, Oudone; Semaničová-Feñovčíková, Andrea |
2010 |
—
|
|
 |
Vertex-magic labelling of non-regular graphs |
Gray, I. D.; MacDougall, J. A. |
2010 |
—
|
|
 |
An algorithm for the optimization of multiple classifiers in data mining based on graphs |
Kelarev, Andrei; Ryan, Joe; Yearwood, John |
2009 |
—
|
|
 |
Cayley graphs as classifiers for data mining: the influence of asymmetries |
Kelarev, Andrei; Ryan, Joe; Yearwood, John |
2009 |
—
|
|
 |
Complete catalogue of graphs of maximum degree 3 and defect at most 4 |
Miller, Mirka; Pineda-Villavicencio, Guillermo |
2009 |
—
|
|
 |
A complexity dichotomy for finding disjoint solutions of vertex deletion problems |
Fellows, Michael R.; Guo, Jiong; Moser, Hannes; Niedermeier, Rolf |
2009 |
—
|
|
List View
