The binding number of a random graph

Article English OPEN
Zverovich, V. (1997)
  • Publisher: Centre for Combinatorics
  • References (5)

    [1] B. Bollob´as, Degree sequences of random graphs, Discrete Math. 33 (1981) 1-19.

    [2] H. Chernoff, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann. Math. Stat. 23 (1952) 493-509.

    [3] P. Erd¨os and R.J. Wilson, On the chromatic index of almost all graphs, J. Combinatorial Theory Ser. B 23 (1977) 255-257.

    [4] K. Weber, Random graphs - a survey, Rostock. Math. Kolloq. 21 (1982) 83-98.

    [5] D.R. Woodall, The binding number of a graph and its Anderson number, J. Combinatorial Theory Ser. B 15 (1973) 225-255.

  • Metrics
    0
    views in OpenAIRE
    0
    views in local repository
    5
    downloads in local repository

    The information is available from the following content providers:

    From Number Of Views Number Of Downloads
    UWE Research Repository - IRUS-UK 0 5
Share - Bookmark