The following pages link to Geňa Hahn (Q221686):
Displayed 44 items.
- Lexicographic products with high reconstruction numbers (Q418863) (← links)
- Cops and robbers ordinals of cop-win trees (Q512565) (← links)
- Infinite generalized friendship graphs (Q793756) (← links)
- A note concerning paths and independence number in digraphs (Q913811) (← links)
- Infinite friendship graphs with infinite parameters (Q918996) (← links)
- Some bounds on the injective chromatic number of graphs (Q960972) (← links)
- Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete (Q967292) (← links)
- (Q1014120) (redirect page) (← links)
- Intervals of Sabidussi graphs (Q1014121) (← links)
- The capture time of a graph (Q1045043) (← links)
- Concerning the achromatic number of graphs (Q1065819) (← links)
- Path and cycle sub-Ramsey numbers and an edge-colouring conjecture (Q1088687) (← links)
- (Q1147155) (redirect page) (← links)
- The automorphism group of the wreath product of directed graphs (Q1147156) (← links)
- More star sub-Ramsey numbers (Q1150381) (← links)
- The automorphism group of a product of hypergraphs (Q1257907) (← links)
- On a matrix partition conjecture (Q1345880) (← links)
- Edge-ends in countable graphs (Q1362094) (← links)
- A lower bound on the size of an absorbing set in an arc-coloured tournament (Q1618229) (← links)
- Absorbing sets in arc-coloured tournaments (Q1827776) (← links)
- On the injective chromatic number of graphs (Q1849923) (← links)
- On cop-win graphs (Q1850039) (← links)
- On the ultimate independence ratio of a graph (Q1893949) (← links)
- Minimal graphs that fold onto \(K_ n\) (Q1896362) (← links)
- Some results on the injective chromatic number of graphs (Q1928520) (← links)
- A note on the circuit double cover of infinite graphs (Q2364863) (← links)
- A note on \(k\)-cop, \(l\)-robber games on graphs (Q2433710) (← links)
- Large classes of infinite k-cop-win graphs (Q3061192) (← links)
- (Q3216676) (← links)
- (Q3410577) (← links)
- (Q3558603) (← links)
- (Q3739151) (← links)
- (Q3852207) (← links)
- (Q4352272) (← links)
- (Q4457550) (← links)
- (Q4489145) (← links)
- (Q4848762) (← links)
- (Q4881843) (← links)
- (Q5298901) (← links)
- (Q5298910) (← links)
- (Q5445040) (← links)
- Cycle regular graphs need not be transitive (Q5951968) (← links)
- Edge clique covers in graphs with independence number two (Q6055943) (← links)
- Siblings of countable cographs (Q6339453) (← links)