The following pages link to (Q3666625):
Displaying 13 items.
- Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs (Q444440) (← links)
- Combinatorial characterization of read-once formulae (Q685684) (← links)
- Stability of two player game structures (Q948685) (← links)
- Not complementary connected and not CIS \(d\)-graphs form weakly monotone families (Q966046) (← links)
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited (Q967361) (← links)
- Vertex- and edge-minimal and locally minimal graphs (Q1043552) (← links)
- Tight and effectively rectangular game forms: A Nash solvable class (Q1268631) (← links)
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs (Q1345961) (← links)
- Critical properties and complexity measures of read-once Boolean functions (Q2043436) (← links)
- The read once formula of a series-parallel network (Q2166241) (← links)
- Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games (Q2515585) (← links)
- On linear rewriting systems for Boolean logic and some applications to proof theory (Q2974793) (← links)
- Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles (Q6094712) (← links)
