Charles A. Cusack

From MaRDI portal
(Redirected from Charles A. Cusack)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Graph pebbling algorithms and Lemke graphs
Discrete Applied Mathematics
2019-05-23Paper
Two-pebbling and odd-two-pebbling are not equivalent
Discrete Mathematics
2019-01-22Paper
Doppelgangers and Lemke graphs
Discrete Mathematics
2018-08-15Paper
Multidesigns of complete graphs for graph-triples of order 6
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing
2016-03-16Paper
The complexity of pebbling reachability and solvability in planar and outerplanar graphs
Discrete Applied Mathematics
2014-05-06Paper
The complexity of pebbling in diameter two graphs
SIAM Journal on Discrete Mathematics
2013-01-04Paper
Pebbling Algorithms in Diameter Two Graphs
SIAM Journal on Discrete Mathematics
2010-06-01Paper
Semiregular large sets
Designs, Codes and Cryptography
2001-01-01Paper
Large sets of 3‐designs from psl(2, q), with block sizes 4 and 5
Journal of Combinatorial Designs
1998-01-21Paper
Partial Steiner triple systems with equal-sized holes
Journal of Combinatorial Theory. Series A
1995-04-04Paper


Research outcomes over time


This page was built for person: Charles A. Cusack