Peter Mark Kayll

Orcid: 0000-0003-0643-5008

According to our database1, Peter Mark Kayll authored at least 18 papers between 1997 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Deranged Matchings: Proofs and Conjectures.
Am. Math. Mon., 2024

2021
Uniquely $D$-Colourable Digraphs with Large Girth II: Simplification via Generalization.
Electron. J. Comb., 2021

On random digraphs and cores.
Australas. J Comb., 2021

2017
The length distribution for burn-off chip-firing games on complete graphs.
Bull. ICA, 2017

A chip-firing variation and a Markov chain with uniform stationary distribution.
Australas. J Comb., 2017

2015
Deranged Matchings: Enumeration by Integration!!
Am. Math. Mon., 2015

2013
A chip-firing variation and a new proof of Cayley's Formula.
Discret. Math. Theor. Comput. Sci., 2013

2010
König-Egerváry Graphs are Non-Edmonds.
Graphs Comb., 2010

2009
Another short proof of the Joni-Rota-Godsil integral formula for counting bipartite matchings.
Contributions Discret. Math., 2009

2005
A note on weak Sidon sequences.
Discret. Math., 2005

2004
The circular chromatic number of a digraph.
J. Graph Theory, 2004

Well-spread sequences and edge-labellings with constant Hamilton-weight.
Discret. Math. Theor. Comput. Sci., 2004

2003
On constant-weight TSP-tours.
Discuss. Math. Graph Theory, 2003

2002
On pebbling threshold functions for graph sequences.
Discret. Math., 2002

2001
Asymptotically good choice numbers of multigraphs.
Ars Comb., 2001

1999
Asymptotics of the total chromatic number for multigraphs.
Australas. J Comb., 1999

1997
Fractional v. Integral Covers in Hypergraphs of Bounded Edge Size.
J. Comb. Theory, Ser. A, 1997

On the Stochastic Independence Properties of Hard-Core Distributions.
Comb., 1997


  Loading...