Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #301 to #350.

An enumeration of simplicial 4-polytopes with 8 vertices: Label: en
A characterization of cubic lattice graphs: Label: en
A characterization of tetrahedral graphs: Label: en
Enumeration of colored graphs: Label: en
Problèmes d'associativité: Une structure de treillis finis induite par une loi demi-associative: Label: en
On the number of inequivalent steiner triple systems: Label: en
Color patterns that are invariant under a given permutation of the colors: Label: en
On a relation between labeled graphs and permutations: Label: en
Note on a q-series transform: Label: en
On the unique determination of the cyclotomic numbers for galois fields and galois domains: Label: en
On canonical bases of ideals: Label: en
Parallel minimax search for a maximum: Label: en
Certain properties of orbits under collineation groups: Label: en
A combinatorial property of spanning forests in connected graphs: Label: en
A correction to: On the algebraic theory of graph colorings: Label: en
Zum Basisproblem für Graphenmengen, insbesondere für die nicht in die projektive Ebene einbettbaren Graphen: Label: en
Die dicke des n-dimensionalen Würfel-graphen: Label: en
Incidence graphs of convex polytopes: Label: en
A calculus for a certain class of word problems in groups: Label: en
The genus of K12s: Label: en
The genus of a class of graphs: Label: en
A simple new method for calculating the characters of the symmetric groups: Label: en
The number of idempotent elements in symmetric semigroups: Label: en
Quasi-symmetric balanced incomplete block designs: Label: en
On Dilworth's decomposition theorem for partially ordered sets: Label: en
A minimal point of a finite metric set: Label: en
An enumeration of the sets of non-interfering arithmetic progressions with specified periods: Label: en
Notes on plane partitions. I: Label: en
On a class of (0,1) matrices with vanishing determinants: Label: en
Applications of the notion of independence to problems of combinatorial analysis: Label: en
Representatives of subsets: Label: en
Some new partition theorems: Label: en
Partition theorems related to the Rogers-Ramanujan identities: Label: en
Some functional equations related to binomial coefficient summation: Label: en
The football pool problem for 5 matches: Label: en
Directed graphs having all bisections: Label: en
Lengths of snakes in boxes: Label: en
Shadows of finite sets: Label: en
On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon: Label: en
Fastplättbare Graphen: Label: en
On planar geodetic graphs: Label: en
A short proof of Sperner's lemma: Label: en
On free alternative rings: Label: en
A combinatorial property of finite sequences with an application to tensor algebra: Label: en
An application of a theorem of de Bruijn Tengbergen, and Kruyswijk: Label: en
A characterization of flat spaces in a finite geometry and the uniqueness of the hamming and the MacDonald codes: Label: en
The square root of a graph: Label: en
A criterion for planarity of the square of a graph: Label: en
On the average activity of a spanning tree of a rooted map: Label: en
Infinite graphs—A survey: Label: en