default search action
Christina Graves 0001
Person information
- affiliation: University of Texas at Tyler, Department of Mathematics, TX, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j19]Christina Graves, Lindsey-Kay Lauderdale:
Fixing Numbers of Graphs with Symmetric and Generalized Quaternion Symmetry Groups. Graphs Comb. 40(1): 14 (2024) - 2023
- [j18]Kassie Archer
, Christina Graves:
A new statistic on Dyck paths for counting 3-dimensional Catalan words. Discret. Math. 346(3): 113247 (2023) - [j17]Christina Graves
More reliable graphs are not always stronger. Networks 81(4): 490-498 (2023) - 2022
- [j16]Kassie Archer
Pattern-restricted permutations composed of 3-cycles. Discret. Math. 345(7): 112895 (2022) - 2021
- [j15]Jason I. Brown
Network reliability: Heading out on the highway. Networks 77(1): 146-160 (2021) - 2020
- [j14]Kassie Archer, Ira M. Gessel, Christina Graves, Xuming Liang:
Counting acyclic and strong digraphs by descents. Discret. Math. 343(11): 112041 (2020) - [j13]Isaac Brown, Christina Graves
Most reliable two-terminal graphs with node failures. Networks 76(3): 414-426 (2020)
2010 – 2019
- 2019
- [j12]Kassie Archer, Christina Graves, David Milan:
Classes of uniformly most reliable graphs for all-terminal reliability. Discret. Appl. Math. 267: 12-29 (2019) - [j11]Christina Graves
Vertex-minimal graphs with dihedral symmetry II. Discret. Math. 342(5): 1378-1391 (2019) - 2018
- [j10]Christina Graves
Smallest graphs with given generalized quaternion automorphism group. J. Graph Theory 87(4): 430-442 (2018) - [j9]Hayley Bertrand, Owen Goff, Christina Graves
On uniformly most reliable two-terminal graphs. Networks 72(2): 200-216 (2018) - 2017
- [j8]Christina Graves
Vertex-minimal graphs with dihedral symmetry I. Discret. Math. 340(10): 2573-2588 (2017) - 2015
- [j7]Christina Graves, Jennifer McLoud-Mann, Kristen Stagg Rovira:
Extending patches to fullerenes. Ars Math. Contemp. 9(2): 209-222 (2015) - 2014
- [j6]Jack E. Graver, Christina Graves, Stephen J. Graves:
Fullerene patches II. Ars Math. Contemp. 7(2): 405-421 (2014) - [j5]Christina Graves, David Milan:
Reliability polynomials having arbitrarily many inflection points. Networks 64(1): 1-5 (2014) - 2012
- [j4]Christina M. Graves, Jennifer McLoud-Mann:
Side lengths of pseudoconvex fullerene patches. Ars Math. Contemp. 5(2): 295-306 (2012) - [j3]Colleen Bouey, Christina Graves, Aaron Ostrander, Gregory Palma:
Non-Recursively Constructible Recursive Families of Graphs. Electron. J. Comb. 19(2): 9 (2012) - 2011
- [j2]Christina Graves:
Inflection points of coherent reliability polynomials. Australas. J Comb. 49: 111-126 (2011) - 2010
- [j1]Jack E. Graver, Christina M. Graves:
Fullerene patches I. Ars Math. Contemp. 3(1): 109-120 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-08 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: