The SCEAS System
Navigation Menu

Search the dblp DataBase


P. Mark Kayll: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. P. Mark Kayll
    Asymptotically good choice numbers of multigraphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2001, v:60, n:, pp:- [Journal]
  2. Jeff Kahn, P. Mark Kayll
    On the Stochastic Independence Properties of Hard-Core Distributions. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:3, pp:369-391 [Journal]
  3. Andrzej Czygrinow, Nancy Eaton, Glenn H. Hurlbert, P. Mark Kayll
    On pebbling threshold functions for graph sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:247, n:1-3, pp:93-105 [Journal]
  4. P. Mark Kayll
    A note on weak Sidon sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:299, n:1-3, pp:141-144 [Journal]
  5. Jeff Kahn, P. Mark Kayll
    Fractional v. Integral Covers in Hypergraphs of Bounded Edge Size. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:78, n:2, pp:199-235 [Journal]
  6. Drago Bokal, Gasper Fijavz, Martin Juvan, P. Mark Kayll, Bojan Mohar
    The circular chromatic number of a digraph. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:46, n:3, pp:227-240 [Journal]
  7. P. Mark Kayll
    Well-spread sequences and edge-labellings with constant Hamilton-weight. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2004, v:6, n:2, pp:401-408 [Journal]

Search in 0.002secs, Finished in 0.002secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002