The following pages link to (Q3741636):
Displaying 19 items.
- On CIS circulants (Q394314) (← links)
- Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs (Q444440) (← links)
- Friendship two-graphs (Q604993) (← links)
- Dominating sequences in graphs (Q740654) (← links)
- Characterizations of cographs as intersection graphs of paths on a grid (Q741533) (← 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)
- Reconstructing unrooted phylogenetic trees from symbolic ternary metrics (Q1670475) (← links)
- Trees as semilattices (Q1901055) (← links)
- Minimum self-dual decompositions of positive dual-minor Boolean functions (Q1961458) (← links)
- Three-way symbolic tree-maps and ultrametrics (Q2304088) (← links)
- Factoring Boolean functions using graph partitioning (Q2387436) (← links)
- Computing square roots of trivially perfect and threshold graphs (Q2446337) (← links)
- Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games (Q2515585) (← links)
- Attempting perfect hypergraphs (Q6076187) (← links)
- Injective split systems (Q6115433) (← links)
- Shared ancestry graphs and symbolic arboreal maps (Q6622737) (← links)
