scientific article; zbMATH DE number 3893204
From MaRDI portal
zbMath0561.05001MaRDI QIDQ5184913
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Extremal problems in graph theory (05C35) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of partitions of integers (05A17) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Connectivity (05C40) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Eulerian and Hamiltonian graphs (05C45) Graph theory (05Cxx) Enumerative combinatorics (05Axx)
Related Items
Graphical Eulerian numbers and chromatic generating functions, A method of enumeration of negative cycles of a signed graph, Negative cycles in complete signed graphs, \(f\)-vectors of pure complexes and pure multicomplexes of rank three, Two classes of \(p\)-Stirling numbers, On some identities with binomial coefficients, The multiset partitions and the generalized Stirling numbers, AN AXIOM SYSTEM FOR A VALUE FOR GAMES IN PARTITION FUNCTION FORM, On the asymptotic average length of a maximum common subsequence for words over a finite alphabet, The matching, birthday and the strong birthday problem: a contemporary review, Simple sequencing problems with interdependent costs, Graph colourings and partitions, Incomplete information and multiple machine queueing problems, Buses, Bullies, and Bijections, Polygonal figures and their form spaces. I: The structure of isodiastemic manifolds (manifolds of equilateral polygons), Reflections on symmetric polynomials and arithmetic functions, Congruences concerning Bernoulli numbers and Bernoulli polynomials, Reduced Gröbner bases, free difference-differential modules and difference-differential dimension polynomials, The maximum clique problem
