default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Mark Kayll
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Daniel Johnston, P. Mark Kayll
, Cory Palmer:
Deranged Matchings: Proofs and Conjectures. Am. Math. Mon. 131(2): 95-111 (2024)- 2023
- [j18]P. Mark Kayll, Michael Morris:
On Colouring Oriented Graphs of Large Girth. Contributions Discret. Math. 18(2): 234-243 (2023) - 2021
- [j17]Esmaeil Parsa, P. Mark Kayll:
On random digraphs and cores. Australas. J Comb. 79: 371-379 (2021) - [j16]P. Mark Kayll, Esmaeil Parsa:
Uniquely $D$-Colourable Digraphs with Large Girth II: Simplification via Generalization. Electron. J. Comb. 28(1): 1 (2021)
2010 – 2019
- 2017
- [j15]Dave Perkins, P. Mark Kayll:
A chip-firing variation and a Markov chain with uniform stationary distribution. Australas. J Comb. 68: 330-345 (2017) - [j14]Dave Perkins, P. Mark Kayll:
The length distribution for burn-off chip-firing games on complete graphs. Bull. ICA 81: 78-97 (2017) - 2015
- [j13]P. Mark Kayll:
Deranged Matchings: Enumeration by Integration!! Am. Math. Mon. 122(1): 51 (2015) - 2013
- [j12]Peter Mark Kayll, Dave Perkins:
A chip-firing variation and a new proof of Cayley's Formula. Discret. Math. Theor. Comput. Sci. 15(1): 121-132 (2013) - 2010
- [j11]P. Mark Kayll:
König-Egerváry Graphs are Non-Edmonds. Graphs Comb. 26(5): 721-726 (2010)
2000 – 2009
- 2009
- [j10]Erin E. Emerson, Peter Mark Kayll:
Another short proof of the Joni-Rota-Godsil integral formula for counting bipartite matchings. Contributions Discret. Math. 4(2) (2009) - 2005
- [j9]P. Mark Kayll:
A note on weak Sidon sequences. Discret. Math. 299(1-3): 141-144 (2005) - 2004
- [j8]P. Mark Kayll:
Well-spread sequences and edge-labellings with constant Hamilton-weight. Discret. Math. Theor. Comput. Sci. 6(2): 401-408 (2004) - [j7]Drago Bokal, Gasper Fijavz, Martin Juvan, P. Mark Kayll, Bojan Mohar:
The circular chromatic number of a digraph. J. Graph Theory 46(3): 227-240 (2004) - 2003
- [j6]Scott Jones, P. Mark Kayll, Bojan Mohar, Walter D. Wallis:
On constant-weight TSP-tours. Discuss. Math. Graph Theory 23(2): 287-307 (2003) - 2002
- [j5]Andrzej Czygrinow, Nancy Eaton, Glenn H. Hurlbert, P. Mark Kayll:
On pebbling threshold functions for graph sequences. Discret. Math. 247(1-3): 93-105 (2002) - 2001
- [j4]P. Mark Kayll:
Asymptotically good choice numbers of multigraphs. Ars Comb. 60 (2001)
1990 – 1999
- 1999
- [j3]P. Mark Kayll:
Asymptotics of the total chromatic number for multigraphs. Australas. J Comb. 19: 279-282 (1999) - 1997
- [j2]Jeff Kahn, P. Mark Kayll:
On the Stochastic Independence Properties of Hard-Core Distributions. Comb. 17(3): 369-391 (1997) - [j1]Jeff Kahn, P. Mark Kayll:
Fractional v. Integral Covers in Hypergraphs of Bounded Edge Size. J. Comb. Theory A 78(2): 199-235 (1997)
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-10-07 22:23 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:
