Publications: Dr. Wendy Myrvold
This page contains a list of my publications, including
access to some preprints. Drop me a line
(wendym@cs.UVic.ca)
if you are
downloading any papers
or if you'd like reprints of some of my older
papers. I love to know that others
are interested in my work.
This page is not being kept up to date.
Google scholar is a better place to get a list of the recent publications.
Index

Technical Reports

Journal Papers

Conference Papers
To get out of here:

Home page for Dr. Wendy Myrvold

My Research: Graph Theory and Graph Algorithms

My favorite links

Department of Computer Science

University of Victoria
Return to index at the
TOP of the page.
Technical Reports

W. Myrvold, T. Hoffman, and S. Trace.
Reliability of Planar Multigraphs.
U. Vic. Technical Report DCS247IR, 5 pages.
( planar.ps )
Return to index at the
TOP of the page.
Refereed Journal Papers

R. J. Kingan, S. R. Kingan, and Wendy Myrvold.
On matroid Generation.
Accepted to Congressus Numerantium, Oct. 2003, 15 pages.

W. Myrvold and J. Roth.
Simpler Projective Plane Embedding.
Accepted to Ars Combinatoria, Jan. 2003, 21 pages.
( roth.ps )
( roth.ps.gz )

D. Drake and W. Myrvold.
The nonexistence of maximal sets of four mutually
orthogonal Latin squares of order 8,
Accepted by Designs, Codes and Cryptography,
Oct. 28, 2002, 8 pages.

W. Myrvold and F. Ruskey.
Ranking and unranking permutations in linear time.
Accepted by Information Processing Letters, Oct., 2000, 6 pages.
( RankPerm.ps )
( RankPerm.ps.gz )

W. Myrvold.
Negative Results for Orthogonal Triples of Latin Squares.
Journal of Combinatorial Mathematics and Combinatorial Computing,
Vol. 29, pp. 95105, 1999.
(Also available as U. Vic. Technical Report DCS248IR).

WenMing Yan, Wendy Myrvold, and
KuoLiang Chung.
A formula for the number of spanning trees of
a multistar
related graph,
Information Processing Letters, Volume 68, pp. 295298, 1998.

B. Gilbert, and W. Myrvold.
Maximizing Spanning Trees in Almost Complete Graphs.
Networks, Vol. 30, pp. 2330, 1997.

C. J. Colbourn, W. J. Myrvold, and E. Neufeld. Two
algorithms for Unranking Arborescences.
Journal of Algorithms,
Vol. 20, pp. 268281, 1996.

FuShang P. Tsen,
TingYi Sung,
MenYang Lin,
LihHsing Hsu,
and Wendy Myrvold. Finding the most vital edges
with respect to the number of spanning trees.
IEEE Transactions on Reliability, Vol. 43, No. 4, pp. 600603, 1994.

C. J. Colbourn, D. D. Harms, and W.J. Myrvold.
Brief Communication: Reliability Polynomials Can Cross Twice.
The Franklin Institute, Vol. 330, No. 3, pp. 629633, 1993.

W. J. Myrvold.
Counting kcomponent forests of a graph.
Networks, Vol. 22, pp. 647652, 1992.
Return to index at the
TOP of the page.

W. J. Myrvold.
The degree sequence is reconstructible from n1 cards.
Discrete Mathematics, Vol. 102, pp. 187196, 1992.

W. J. Myrvold, Kim H. Cheung, Lavon B. Page, and Jo Ellen Perry.
Uniformlymost reliable networks do not always exist.
Networks, Vol. 21, pp. 417419, 1991.

W. J. Myrvold.
The allyreconstruction number
of a tree with five or more vertices is three.
Journal of Graph Theory, 14, No. 2, pp. 149166, 1990.

W. J. Myrvold.
The allyreconstruction number of a disconnected graph.
Ars Combinatoria, 28, pp. 123127, 1989.

G. L. Chia, C. J. Colbourn, and W. J. Myrvold.
Graphs determined by their reliability polynomial.
Ars Combinatoria,
26B, pp. 249251, 1988.

W. J. Myrvold, M. N. Ellingham, and D. G. Hoffman.
Bidegreed graphs are Edge Reconstructible.
Journal of Graph Theory, Vol. 11, No. 3, pp. 281302, 1987.

I. Krasikov, M. N. Ellingham, and W. J. Myrvold.
Legitimate Number Decks for Trees.
Ars Combinatoria, Vol. 21, pp. 1517, 1986.
Return to index at the
TOP of the page.
Conference Papers

W. Myrvold and J. Roth.
Simpler Projective Plane Embedding.
Preprint accepted by Elsevier Preprint, June, 2000.
Sixth International Conference on Graph Theory,
Marseille France, Aug. 28Sept. 1, 2000, 4 pages.
[See corresponding journal paper above if you want the details]

J. Boyer and W. Myrvold.
Stop minding your P's and Q's:
A simplified O(n) planar embedding algorithm.
Tenth
Annual ACMSIAM Symposium
on Discrete Algorithms (SODA),
pp. 140146, 1999.
( boyer.ps )
( boyer.ps.gz )
A journal version entitled
Stop minding your P's and Q's:
Simplified Planarity by Edge Addition
has been submitted to
Journal of Graph Algorithms and Applications,
Oct. 6, 2003, 25 pages.
( planarity.ps )
(planarity.ps.gz )

W. Myrvold.
Reliable Network Synthesis: Some Recent Developments.
Accepted to Proceedings of the Eighth International Conference on
Graph Theory, Combinatorics, Algorithms, and Applications,
Volume II, pp. 650660, 1998.
( synthesis.ps )
( synthesis.ps.gz )

B. McKay, W. Myrvold, and J. Nadon.
Fast backtracking principles applied to find new cages.
Ninth
Annual ACMSIAM Symposium
on Discrete Algorithms (SODA),
pp. 188191, 1998.
( girth.ps )
( girth.ps.gz )

W. Myrvold, T. Prsa, and N. Walker.
A Dynamic programming approach for timing and designing clique algorithms.
Algorithms and Experiments (ALEX '98):
Building Bridges Between Theory and Applications,
pp. 8895, 1998.
( clique.ps )
( clique.ps.gz )

E. Neufeld, and W. Myrvold.
Practical Toroidality Testing.
Eighth Annual ACMSIAM Symposium
on Discrete Algorithms (SODA),
pp. 574580, 1997.
(Also available as U. Vic. Technical Report DCS244IR).
( torus.ps )
( torus.ps.gz )

W. J. Myrvold.
A report on the ally reconstruction problem.
Proceedings of the Sixth Quadrennial International Conference on the Theory
and Applications of Graphs,
Graph Theory, Combinatorics and Applications, Vol. 2,
ed. by Y. Alavi, G. Chartrand, O. R. Oellermann, and A. J. Schwenk,
pp. 949956, 1988.

C. J. Colbourn, B. M. Debroni, and W. J. Myrvold.
Estimating the coefficients of the reliability polynomial.
Proceedings of the Seventeenth Manitoba Conference on Numerical Mathematics and Computing,
Congressum Numerantium, Vol. 62, pp. 217223, 1988.
Return to index at the
TOP of the page.
Dr. Myrvold's publications page / maintained by
Wendy Myrvold /
wendym@cs.UVic.ca
/ revised March 19, 2002