Most transcluded pages

Jump to: navigation, search

Showing below up to 49 results in range #1 to #49.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

  1. Template:IncludeOpenProblem‏‎ (used on 20 pages)
  2. Template:Pdfbook‏‎ (used on 18 pages)
  3. Template:ColourA‏‎ (used on 16 pages)
  4. Template:Wikilog user manual index‏‎ (used on 9 pages)
  5. Template:Wikilog user manual footer‏‎ (used on 8 pages)
  6. Template:Wikilog user manual header‏‎ (used on 8 pages)
  7. Maximizing a skew-supermodular function‏‎ (used on 4 pages)
  8. Capacitated packing of k-arborescences‏‎ (used on 4 pages)
  9. Template:DiscussionLink‏‎ (used on 3 pages)
  10. Destroying rigidity‏‎ (used on 3 pages)
  11. Kriesell's conjecture‏‎ (used on 2 pages)
  12. Disjoint spanning in- and out-arborescences‏‎ (used on 2 pages)
  13. Template:Saved book‏‎ (used on 2 pages)
  14. Opposite vertices of base polyhedra‏‎ (used on 2 pages)
  15. Exact matching in red-blue bipartite graphs‏‎ (used on 2 pages)
  16. Characterization of graphs having a k-connected orientation‏‎ (used on 2 pages)
  17. Covering a symmetric crossing supermodular function with hyperedges of prescribed size‏‎ (used on 1 page)
  18. Independent arborescences in acyclic digraphs‏‎ (used on 1 page)
  19. Woodall's conjecture‏‎ (used on 1 page)
  20. Cyclic orderings of matroids‏‎ (used on 1 page)
  21. Independent trees‏‎ (used on 1 page)
  22. Decomposition of oriented k-partition-connected digraphs‏‎ (used on 1 page)
  23. Integer decomposition of smooth polytopes‏‎ (used on 1 page)
  24. Disjoint Steiner-trees‏‎ (used on 1 page)
  25. List colouring of two matroids‏‎ (used on 1 page)
  26. Local edge-connectivity augmentation of a hypergraph with fixed rank‏‎ (used on 1 page)
  27. Disjoint strongly connected spanning subgraphs‏‎ (used on 1 page)
  28. Edge-disjoint spanning trees and paths‏‎ (used on 1 page)
  29. Minimum k-way cut in a hypergraph‏‎ (used on 1 page)
  30. Achieve global rigidity by pinning nodes‏‎ (used on 1 page)
  31. Edmonds' disjoint arborescences theorem‏‎ (used on 1 page)
  32. Minimum polychromatic number for plane graphs with fixed girth‏‎ (used on 1 page)
  33. Are t-perfect graphs strongly t-perfect?‏‎ (used on 1 page)
  34. Equitability of matroids‏‎ (used on 1 page)
  35. Equitable list colouring‏‎ (used on 1 page)
  36. Rank-respecting augmentation of hypergraphs with negamodular constraints‏‎ (used on 1 page)
  37. Characterization of dual-critical graphs‏‎ (used on 1 page)
  38. Scrambled Rota conjecture‏‎ (used on 1 page)
  39. Existence of completely stable flow‏‎ (used on 1 page)
  40. Skew-supermodular colouring with two class sizes‏‎ (used on 1 page)
  41. Chromatic number of t-perfect graphs‏‎ (used on 1 page)
  42. Expressing vectors using bases of a matroid‏‎ (used on 1 page)
  43. Skew-supermodular list colouring‏‎ (used on 1 page)
  44. Conforti-Cornuéjols conjecture on the MFMC property‏‎ (used on 1 page)
  45. Extreme direction Sperner for square 0-1 matrix‏‎ (used on 1 page)
  46. Tutte's disjoint tree theorem‏‎ (used on 1 page)
  47. Covering a crossing supermodular function with graph edges‏‎ (used on 1 page)
  48. Incomplete splitting-off in digraphs‏‎ (used on 1 page)
  49. Upper bound on common independent set cover‏‎ (used on 1 page)

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)