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 #1 to #50.

On Mutually Orthogonal Resolutions and Near-Resolutions: Label: en
Lattice Polyhedra II: Generalization, Constructions and Examples: Label: en
Distance-Regular Graphs with Diameter Three: Label: en
Flow Network Formulations of Polymatroid Optimization Problems: Label: en
An Algorithm for Submodular Functions on Graphs: Label: en
An Efficient Primal Simplex Algorithm for Maximum Weighted Vertex Packing on Bipartite Graphs: Label: en
A Combinatorial Construction of the Small Mathieu Designs and Groups: Label: en
Embedding Latin Squares with Prescribed Diagonal: Label: en
High Chromatic Rigid Graphs II: Label: en
Bounding the Independence Number of a Graph: Label: en
Transformations which Preserve Perfectness and H-Perfectness of Graphs: Label: en
Colour Schemes: Label: en
Ear Decompositions of Elementary Graphs and GF2-rank of Perfect Matchings: Label: en
Two Remarks on the Mendelsohn-Dulmage Theorem: Label: en
Direct Constructions for Perfect 3-Cyclic Designs: Label: en
Embeddings and Prescribed Intersections of Transitive Triple Systems: Label: en
Minimization of Some Nonlinear Functions over Polymatroidal Network Flows: Label: en
Homomorphism Interpolation and Approximation: Label: en
Parity Graphs: Label: en
Augmenting Paths and a Class of Independence Systems: Label: en
Asymptotical Estimations for the Number of Cliques of Uniform Hypergraphs: Label: en
Min-max Relations for Directed Graphs: Label: en
Match-Tables: Label: en
Two Lines Least Squares: Label: en
The Analysis of Directed Triple Systems by Refinement: Label: en
Logic of Equality in Geometry: Label: en
School Timetables: Label: en
Finite Representations of Two-Variable Identities or Why are Finite Fields Important in Combinatorics?: Label: en
The Bandwidth Problem: critical Subgraphs and the Solution for Caterpillars: Label: en
Cycles Through Prescribed and Forbidden Point Sets: Label: en
Polyhedra for Composed Independence Systems: Label: en
On Linked Arrays of Pairs: Label: en
A Partial Geometry pg(9, 8, 4): Label: en
Prolongation in m-Dimensional Permutation Cubes: Label: en
A Direct Construction for Latin Squares Without Proper Subsquares: Label: en
Pictures in Lattice Theory: Label: en
On Hamiltonian Cycles in Metacirculant Graphs: Label: en
Simple Steiner Quadruple Systems: Label: en
Scheduling Problems with a Singular Solution: Label: en
Optimal Subtrees and Extensions: Label: en
Enumeration of Symmetric Designs (25,9,3): Label: en
Rectagraphs, Diagrams, and Suzuki's Sporadic Simple Group: Label: en
A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem: Label: en
How To Color Claw-Free Perfect Graphs: Label: en
Sufficient Conditions for Graphs to Have Threshold Number 2: Label: en
Threshold Numbers and Threshold Completions: Label: en
Integer and Fractional Matchings: Label: en
An Investigation of Algorithms Used in the Restructuring of Linear Programming Basis Matrices Prior to Inversion: Label: en
On The Number of Nonnegative Integer Solutions of a System of Linear Diophantine Equations: Label: en
Minimal Test Set for Diagnosing a Tree System: Label: en