Most transcluded pages
Showing below up to 49 results in range #1 to #49.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- Template:ColourA (used on 22 pages)
- Template:IncludeOpenProblem (used on 20 pages)
- Template:Pdfbook (used on 18 pages)
- Template:Wikilog user manual index (used on 9 pages)
- Template:Wikilog user manual footer (used on 8 pages)
- Template:Wikilog user manual header (used on 8 pages)
- Maximizing a skew-supermodular function (used on 4 pages)
- Capacitated packing of k-arborescences (used on 4 pages)
- Template:DiscussionLink (used on 3 pages)
- Destroying rigidity (used on 3 pages)
- Kriesell's conjecture (used on 2 pages)
- Disjoint spanning in- and out-arborescences (used on 2 pages)
- Template:Saved book (used on 2 pages)
- Opposite vertices of base polyhedra (used on 2 pages)
- Exact matching in red-blue bipartite graphs (used on 2 pages)
- Characterization of graphs having a k-connected orientation (used on 2 pages)
- Conforti-Cornuéjols conjecture on the MFMC property (used on 1 page)
- Extreme direction Sperner for square 0-1 matrix (used on 1 page)
- Tutte's disjoint tree theorem (used on 1 page)
- Covering a crossing supermodular function with graph edges (used on 1 page)
- Incomplete splitting-off in digraphs (used on 1 page)
- Upper bound on common independent set cover (used on 1 page)
- Covering a symmetric crossing supermodular function with hyperedges of prescribed size (used on 1 page)
- Independent arborescences in acyclic digraphs (used on 1 page)
- Woodall's conjecture (used on 1 page)
- Cyclic orderings of matroids (used on 1 page)
- Independent trees (used on 1 page)
- Decomposition of oriented k-partition-connected digraphs (used on 1 page)
- Integer decomposition of smooth polytopes (used on 1 page)
- Disjoint Steiner-trees (used on 1 page)
- List colouring of two matroids (used on 1 page)
- Local edge-connectivity augmentation of a hypergraph with fixed rank (used on 1 page)
- Disjoint strongly connected spanning subgraphs (used on 1 page)
- Edge-disjoint spanning trees and paths (used on 1 page)
- Minimum k-way cut in a hypergraph (used on 1 page)
- Achieve global rigidity by pinning nodes (used on 1 page)
- Edmonds' disjoint arborescences theorem (used on 1 page)
- Minimum polychromatic number for plane graphs with fixed girth (used on 1 page)
- Are t-perfect graphs strongly t-perfect? (used on 1 page)
- Equitability of matroids (used on 1 page)
- Equitable list colouring (used on 1 page)
- Rank-respecting augmentation of hypergraphs with negamodular constraints (used on 1 page)
- Characterization of dual-critical graphs (used on 1 page)
- Scrambled Rota conjecture (used on 1 page)
- Existence of completely stable flow (used on 1 page)
- Skew-supermodular colouring with two class sizes (used on 1 page)
- Chromatic number of t-perfect graphs (used on 1 page)
- Expressing vectors using bases of a matroid (used on 1 page)
- Skew-supermodular list colouring (used on 1 page)
