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 #101 to #150.

The genus of the complete tripartite graph Kmn,n,n: Label: en
Graphs whose complement and line graph are isomorphic: Label: en
A generalization of the linear complementarity problem: Label: en
The distance between points in random trees: Label: en
Cesaro sums and measurable transformations: Label: en
On f-plentiful numbers: Label: en
A packing theory: Label: en
Upper bounds on the length of circuits of even spread in the d-cube: Label: en
The group of an X-join of graphs: Label: en
On orthogonal m-pods on a cone: Label: en
Flows in infinite graphs: Label: en
On the p-rank of the incidence matrix of points and hyperplanes in a finite projective geometry: Label: en
On the maximal distance of spanning trees: Label: en
The enumeration of c-nets via quadrangulations: Label: en
Some non-isomorphic graphs: Label: en
A counterexample to the countable version of a conjecture of Ulam: Label: en
Toward a theory of crossing numbers: Label: en
On automorphism groups of block designs: Label: en
A note on quasi-symmetric designs: Label: en
A counterexample to a direct product construction of Room squares: Label: en
On furnishing Room squares: Label: en
A generalization of a combinatorial theorem of macaulay: Label: en
On subsets contained in a family of non-commensurable subsets of a finite set: Label: en
A remark on B4-Sequences: Label: en
Some new partition theorems. II: Label: en
Le problème des régions voisines sur les surfaces closes orientables: Label: en
Solution of the Heawood map-coloring problem—case 11: Label: en
Memorial note: Label: en
Oystein Ore: Label: en
A class of covers for finite projective geometries which are related to the design of combinatorial filing systems: Label: en
The Burnside algebra of a finite group: Label: en
Connectivity of transitive graphs: Label: en
Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen: Label: en
Some inequalities from switching theory: Label: en
Packing a rectangular box with the twelve solid pentominoes: Label: en
Permanents of cyclic (0,1) matrices: Label: en
Note on the visual hull of a set: Label: en
An interval graph is a comparability graph: Label: en
An interval graph is not a comparability graph: Label: en
Enumeration of polyhedra: The number of 9-hedra: Label: en
Orbit complexes of graphs: Label: en
A characterization of the Tm graph: Label: en
On a problem of P. Erdös: Label: en
Bounds for the chromatic number of a graph: Label: en
On direction-preserving maps of graphs: Label: en
Signed distance graphs: Label: en
Enumeration under group action: Unsolved graphical enumeration problems, IV: Label: en
Minimal completely separating systems: Label: en
Generalizations of Terquem's problem: Label: en
Lattices with sublattices of a given order: Label: en