Pages without language links
The following pages do not link to other language versions.
Showing below up to 50 results in range #1 to #50.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)
- Abelian property of the chip-firing game
- Achieve global rigidity by pinning nodes
- Acyclic orientation with connectivity prescriptions
- Acyclic orientation with parity constraints
- Aharoni-Berger conjecture
- All categories
- Arborescence
- Arboricity
- Are t-perfect graphs strongly t-perfect?
- Are there deletion-contraction formulas for the polymatroid Tutte polynomial?
- Base orderable matroid
- Base polyhedron
- Berge's conjecture on path partitions
- Bi-set
- Binary matroid representation of cyclic families
- Blog posts
- Bounded degree matroid basis
- Braid and bundle
- Caccetta-Häggkvist conjecture
- Capacitated packing of k-arborescences
- Capacity-obeying packing
- Carathéodory rank
- Changing conservative weightings in bipartite graphs
- Characterization of dual-critical graphs
- Characterization of graphs having a k-connected orientation
- Characterizing integral g-polymatroids
- Chip-firing
- Chromatic number
- Chromatic number of t-perfect graphs
- Clutter
- Colouring
- Compactness of Kőnig-property
- Compatible Euler-tours
- Complexity of computing a v-reduced divisor in multigraphs
- Complexity of computing the rotor-router action
- Complexity of the chip-firing reachability problem for general digraphs
- Complexity of the halting problem for Eulerian multigraphs
- Complexity of the halting problem for simple digraphs
- Conforti-Cornuéjols conjecture on the MFMC property
- Conservative weighting
- Constructive characterization of dumpy graphs
- Convex node set
- Count matroid
- Covering a crossing supermodular function with graph edges
- Covering a crossing supermodular function with pairwise non-parallel arcs
- Covering a symmetric crossing supermodular function with hyperedges of prescribed size
- Covering number
- Cycles and paths
- Cyclic orderings of matroids
- Cyclic stable matchings
