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 #51 to #100.

The crossing number of K5,n: Label: en
Symmetric embeddings of graphs: Label: en
Decomposing partial orderings into chains: Label: en
Graphs, matroids, and geometric lattices: Label: en
Some combinatorial properties of transformations and their connections with the theory of graphs: Label: en
Characterizations of derived graphs: Label: en
On n-uniform Hjelmslev planes: Label: en
Bounds assuring subsets in convex position: Label: en
Cooperative classes of finite sets in one and more dimensions: Label: en
Enumeration of sequences by length and spread: Label: en
Higher-Dimensional analogs of the four-color problem and some inequalities for simplicial complexes: Label: en
A completely unambiguous 5-polyhedral graph: Label: en
On the existence of regular n-graphs with given girth: Label: en
Algebraic approach to stopping variable problems: Representation theory and applications: Label: en
Zum basisproblem der nicht in die projektive ebene einbettbaren graphen, I: Label: en
Non-isomorphic solutions of some balanced incomplete block designs. I: Label: en
The lexicographically least de Bruijn cycle: Label: en
L'épaisseur des graphes complets K34 et K40: Label: en
Hamiltonian circuits on 3-polytopes: Label: en
Subgraphs with prescribed valencies: Label: en
Hereditary and recurrent properties in lattices: Label: en
Some groups of prime exponent: Label: en
Optimal assignments in an ordered set: An application of matroid theory: Label: en
On the extreme points of a certain convex polytope: Label: en
A sufficient condition for hamiltonian connectedness: Label: en
A new proof of Brooks's chromatic number theorem for graphs: Label: en
Some covering concepts in graphs: Label: en
The achromatic number of a graph: Label: en
A matching theorem for graphs: Label: en
Some simple perfect 2×1 rectangles: Label: en
Solution of the heawood map-coloring problem—Cases 3, 5, 6, and 9: Label: en
The heawood map-coloring problem—Cases 1, 7, and 10: Label: en
Solution of the heawood map-coloring problem—Case 4: Label: en
The smallest triangle-free 4-chromatic 4-regular graph: Label: en
Two Mal'cev-type theorems in universal algebra: Label: en
Operator theoretic invariants and the enumeration theory of Pólya and de Bruijn: Label: en
The determination of all λ-designs with λ=3: Label: en
Some results on λ-designs: Label: en
Common transversals and strong exchange systems: Label: en
Über die Nichtexistenz zweier Knotenpunkte eines Graphen, die alle längsten Kreise fassen: Label: en
Dichromatic graphs and Ramsey numbers: Label: en
Some graph theoretic results associated with Ramsey's theorem: Label: en
Notes on central groupoids: Label: en
On tactical configurations and error-correcting codes: Label: en
Enumeration of certain binary matrices: Label: en
Sur la croissance du nombre de systèmes triples de Steiner non lsomorphes: Label: en
Null genus realizability criterion for abstract intersection sequences: Label: en
A combinatorial proof of Tucker's lemma for the n-cube: Label: en
Two addition theorems: Label: en
New proof of brooks' theorem: Label: en