scientific article

zbMath0554.05002MaRDI QIDQ3216653

Alan C. Tucker

Publication date: 1984

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexitygenerating functionsgraph coloringgraph theoryrecurrence relationsnetwork algorithmsinclusion-exclusionrecursive programmingPolya's enumeration formulaCombinatorial modelingcovering circuitsgames with graphsgeneral counting methods for arrangements and selectionstrees and searching

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Graph theory (including graph drawing) in computer science (68R10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx) Enumerative combinatorics (05Axx)

Related Items (9)

On the determinants of the square-type Stirling matrix and Bell matrix ⋮ On the average genus of a graph ⋮ Avoiding-sequences with minimum sum ⋮ Representation of the Drazin inverse for special block matrix ⋮ Generalized Bell numbers and peirce matrix via Pascal matrix ⋮ A note on the distribution of the Wilcoxon rank sum statistic ⋮ Rational divide-and-conquer relations ⋮ Representations of the Drazin inverse for a class of block matrices ⋮ Studies in Bessel functions via Laplace transforms

This page was built for publication: