Results 11 to 20 of about 37,501 (244)
Cut Vertices in Random Planar Maps [PDF]
, 2023 The main goal of this paper is to determine the asymptotic behavior of the number X n of cut-vertices in random planar maps with n edges. It is shown that X n / n ¿ c in probability (for some explicit c > 0 ).
Benedikt Stufler +6 more
core +1 more source
Well quasi-order in combinatorics : embeddings and homomorphisms [PDF]
, 2015 The notion of well quasi-order (wqo) from the theory of ordered sets often arises naturally in contexts where one deals with infinite collections of structures which can somehow be compared, and it then represents a useful discriminator between ‘tame ...
Ruskuc, Nik +3 more
core +1 more source
Polynomial reconstruction of the matching polynomial
Electronic Journal of Graph Theory and Applications, 2015 The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values for the vertex ...
Xueliang Li, Yongtang Shi, Martin Trinks
doaj +1 more source
International Journal of Mathematical Combinatorics, Vol.3 [PDF]
, 2009 The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source
On the Combinatorics of Cumulants
Journal of Combinatorial Theory, Series A, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gian-Carlo Rota, Jianhong Shen
openaire +1 more source
From light edges to strong edge-colouring of 1-planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 A strong edge-colouring of an undirected graph $G$ is an edge-colouring where every two edges at distance at most~$2$ receive distinct colours. The strong chromatic index of $G$ is the least number of colours in a strong edge-colouring of $G$.
Julien Bensmail +3 more
doaj +1 more source
International Journal of Mathematical Combinatorics, Vol.3A [PDF]
, 2009 The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source
Advances in Applied Mathematics, 2008 We propose a categorical setting for the study of the combinatorics of rational numbers. We find combinatorial interpretation for the Bernoulli and Euler numbers and polynomials.
Héctor Blandín, Rafael Díaz
openaire +3 more sources
International Journal of Mathematical Combinatorics, Vol.5 [PDF]
, 2011 The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source
International Journal of Mathematical Combinatorics, Vol.2A [PDF]
, 2008 The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core +1 more source