summaryrefslogtreecommitdiff
path: root/content/papers.bib
diff options
context:
space:
mode:
Diffstat (limited to 'content/papers.bib')
-rw-r--r--content/papers.bib28
1 files changed, 16 insertions, 12 deletions
diff --git a/content/papers.bib b/content/papers.bib
index 88e7294..ea39d7b 100644
--- a/content/papers.bib
+++ b/content/papers.bib
@@ -1,15 +1,3 @@
-@article{cox_planarcycles,
- author = {Martin, Ryan R.},
- title = {The maximum number of 10- and 12-cycles in a planar graph},
- year = {2022},
- month = {sep},
- eprint = {2106.02966},
- eprinttype = {arxiv},
- eprintclass = {math.CO},
- journal = {Discrete Mathematics},
- keywords = {accepted},
-}
-
@unpublished{unicorns,
author = {King, Emily J. and Mixon, Dustin G. and Parshall, Hans},
title = {Uniquely optimal codes of low complexity are symmetric},
@@ -20,6 +8,22 @@
abstract = {We formulate explicit predictions concerning the symmetry of optimal codes in compact metric spaces. This motivates the study of optimal codes in various spaces where these predictions can be tested.}
}
+@article{cox_planarcycles,
+ author = {Martin, Ryan R.},
+ title = {The maximum number of 10- and 12-cycles in a planar graph},
+ year = {2023},
+ month = {feb},
+ eprint = {2106.02966},
+ eprinttype = {arxiv},
+ eprintclass = {math.CO},
+ journal = {Discrete Mathematics},
+ volume = {346},
+ number = {2},
+ pages = {113245},
+ doi = {10.1016/j.disc.2022.113245},
+ keywords = {published},
+}
+
@article{cox_planarpaths,
author = {Martin, Ryan R.},
title = {Counting paths, cycles and blow-ups in planar graphs},