default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJessica McDonald
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Joshua Harrelson, Jessica McDonald:
List-edge-coloring triangulations with maximum degree at most five. Australas. J Comb. 88: 127-143 (2024)- 2023
- [j18]Karen L. Collins
, Megan E. Heenehan, Jessica McDonald:
Clique immersion in graph products. Discret. Math. 346(8): 113421 (2023) - [i3]Andrea Jiménez, Jessica McDonald, Reza Naserasr, Kathryn Nurse, Daniel A. Quiroz:
Balanced-chromatic number and Hadwiger-like conjectures. CoRR abs/2308.01242 (2023) - 2022
- [j17]Jessica McDonald, Gregory J. Puleo:
Strong coloring 2-regular graphs: Cycle restrictions and partial colorings. J. Graph Theory 100(4): 653-670 (2022) - 2020
- [j16]Michael Guyer, Jessica McDonald:
On clique immersions in line graphs. Discret. Math. 343(12): 112095 (2020) - [j15]Jessica McDonald, Gregory J. Puleo, Craig Tennenhouse:
Packing and Covering Directed Triangles. Graphs Comb. 36(4): 1059-1063 (2020) - [j14]Matt DeVos, Jessica McDonald, Irene Pivotto, Edita Rollová, Robert Sámal:
3-Flows with large support. J. Comb. Theory B 144: 32-80 (2020) - [j13]Jessica McDonald, Gregory J. Puleo:
t-Cores for (Δ+t) -edge-coloring. J. Graph Theory 95(2): 165-180 (2020) - [i2]Jessica McDonald, Gregory J. Puleo:
Strong coloring 2-regular graphs: Cycle restrictions and partial colorings. CoRR abs/2001.05051 (2020)
2010 – 2019
- 2019
- [j12]Matt DeVos, Jessica McDonald, Amanda Montejano:
Non-Monochromatic Triangles in a 2-Edge-Coloured Graph. Electron. J. Comb. 26(3): 3 (2019) - [j11]Joshua Harrelson, Jessica McDonald, Gregory J. Puleo:
List-edge-colouring planar graphs with precoloured edges. Eur. J. Comb. 75: 55-65 (2019) - [i1]Elliot Krop, Jessica McDonald, Gregory J. Puleo:
Upper bounds for inverse domination in graphs. CoRR abs/1907.05966 (2019) - 2018
- [j10]Jessica McDonald, Gregory J. Puleo:
The list chromatic index of simple graphs whose odd cycles intersect in at most one edge. Discret. Math. 341(3): 713-722 (2018) - 2016
- [j9]John Asplund, Jessica McDonald:
On a limit of the method of Tashkinov trees for edge-colouring. Discret. Math. 339(9): 2231-2238 (2016) - [j8]Matt DeVos, Jessica McDonald, Irene Pivotto:
Packing Steiner trees. J. Comb. Theory B 119: 178-213 (2016) - 2014
- [j7]Matt DeVos, Zdenek Dvorák, Jacob Fox, Jessica McDonald, Bojan Mohar, Diego Scheide:
A minimum degree condition forcing complete graph immersion. Comb. 34(3): 279-298 (2014) - [j6]Guillaume Chapuy, Matt DeVos, Jessica McDonald, Bojan Mohar, Diego Scheide:
Packing Triangles in Weighted Graphs. SIAM J. Discret. Math. 28(1): 226-239 (2014) - 2013
- [j5]Matt DeVos, Jessica McDonald, Bojan Mohar, Diego Scheide:
A Note on Forbidding Clique Immersions. Electron. J. Comb. 20(3): 55 (2013) - [j4]Matt DeVos, Jessica McDonald, Diego Scheide:
Average Degree in Graph Powers. J. Graph Theory 72(1): 7-18 (2013) - 2012
- [j3]Matt DeVos, Jessica McDonald, Bojan Mohar, Diego Scheide:
Immersing complete digraphs. Eur. J. Comb. 33(6): 1294-1302 (2012) - [j2]Penny Haxell, Jessica McDonald:
On characterizing Vizing's edge colouring bound. J. Graph Theory 69(2): 160-168 (2012) - [j1]Jessica McDonald, Bojan Mohar, Diego Scheide:
Kempe Equivalence of Edge-Colorings in Subcubic and Subquartic Graphs. J. Graph Theory 70(2): 226-239 (2012)
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 2024-06-10 21:20 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:
