P. Mark Kayll

17 papers Journal 17
YearRankTypeTitle / Venue / Authors
2024 J jnl
Deranged Matchings: Proofs and Conjectures.
Am. Math. Mon.
Daniel Johnston, P. Mark Kayll, Cory Palmer
2023 J jnl
On Colouring Oriented Graphs of Large Girth.
Contributions Discret. Math.
P. Mark Kayll, Michael Morris
2021 J jnl
On random digraphs and cores.
Australas. J Comb.
Esmaeil Parsa, P. Mark Kayll
2021 J jnl
Uniquely $D$-Colourable Digraphs with Large Girth II: Simplification via Generalization.
Electron. J. Comb.
P. Mark Kayll, Esmaeil Parsa
2017 J jnl
A chip-firing variation and a Markov chain with uniform stationary distribution.
Australas. J Comb.
Dave Perkins, P. Mark Kayll
2017 J jnl
The length distribution for burn-off chip-firing games on complete graphs.
Bull. ICA
Dave Perkins, P. Mark Kayll
2015 J jnl
Deranged Matchings: Enumeration by Integration!!
Am. Math. Mon.
P. Mark Kayll
2010 J jnl
König-Egerváry Graphs are Non-Edmonds.
Graphs Comb.
P. Mark Kayll
2005 J jnl
A note on weak Sidon sequences.
Discret. Math.
P. Mark Kayll
2004 J jnl
The circular chromatic number of a digraph.
J. Graph Theory
Drago Bokal, Gasper Fijavz, Martin Juvan, P. Mark Kayll, Bojan Mohar
2004 J jnl
Well-spread sequences and edge-labellings with constant Hamilton-weight.
Discret. Math. Theor. Comput. Sci.
P. Mark Kayll
2003 J jnl
On constant-weight TSP-tours.
Discuss. Math. Graph Theory
Scott Jones, P. Mark Kayll, Bojan Mohar, Walter D. Wallis
2002 J jnl
On pebbling threshold functions for graph sequences.
Discret. Math.
Andrzej Czygrinow, Nancy Eaton, Glenn H. Hurlbert, P. Mark Kayll
2001 J jnl
Asymptotically good choice numbers of multigraphs.
Ars Comb.
P. Mark Kayll
1999 J jnl
Asymptotics of the total chromatic number for multigraphs.
Australas. J Comb.
P. Mark Kayll
1997 J jnl
Fractional v. Integral Covers in Hypergraphs of Bounded Edge Size.
J. Comb. Theory A
Jeff Kahn, P. Mark Kayll
1997 J jnl
On the Stochastic Independence Properties of Hard-Core Distributions.
Comb.
Jeff Kahn, P. Mark Kayll