Pages that link to "Template:ColourA"
The following pages link to Template:ColourA:
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Cyclic stable matchings (transclusion) (← links)
- Well-balanced orientations of hypergraphs (transclusion) (← links)
- Making the union of two directed spanning trees strongly connected (transclusion) (← links)
- Union of a spanning arborescence and a directed spanning tree (transclusion) (← links)
- Node disjoint circuits in Eulerian digraphs (transclusion) (← links)
- Existence of completely stable flow (transclusion) (← links)
- Finding the largest popular matching in a bipartite graph (transclusion) (← links)
- Characterization of graphs having a k-connected orientation (transclusion) (← links)
- Graphs extendable to a uniquely matchable bipartite graph (transclusion) (← links)
- Decomposition into two trees with orientation constraints (transclusion) (← links)
- Skew-supermodular list colouring (transclusion) (← links)
- Smooth well-balanced orientations with prescribed in-degrees (transclusion) (← links)
- Partial vertex cover in bipartite graphs (transclusion) (← links)
- Expressing vectors using bases of a matroid (transclusion) (← links)
- Skew-supermodular colouring with prescribed class-sizes (transclusion) (← links)
- Small representations of gammoids (transclusion) (← links)
- Edge-disjoint T-connectors (transclusion) (← links)
- Maximizing a skew-supermodular function (transclusion) (← links)
- Characterizing integral g-polymatroids (transclusion) (← links)
- Decomposition into forests and a bounded-degree subgraph (transclusion) (← links)
- Finding a 2-way stable 3-way exchange (transclusion) (← links)
- Deciding the existence of popular matchings (transclusion) (← links)
