The following pages link to Dennis P. Geller (Q1211471):
Displayed 23 items.
- Generalization of a theorem of Fleck, Hedetniemi and Oehmke on \({\mathcal S}^*\)-semigroups of automata (Q1211472) (← links)
- r-tuple colorings of uniquely colorable graphs (Q1230631) (← links)
- Item:Q1211471 (redirect page) (← links)
- The chromatic number and other functions of the lexicographic product (Q1843453) (← links)
- Walkwise and admissible mappings between digraphs (Q1845747) (← links)
- Graphs with forbidden subgraphs (Q2547895) (← links)
- Realization with Feedback Encoding. II: Applications to Distinguishing Sequences (Q4047111) (← links)
- (Q4081157) (← links)
- Coding graphs by contractions (Q4093488) (← links)
- (Q4121921) (← links)
- How to colour the lines of a bigraph (Q4767332) (← links)
- Further results on the achromatic number (Q4773730) (← links)
- Realization with Feedback Encoding. I: Analogues of the Classical Theory (Q5183418) (← links)
- The square root of a digraph (Q5554172) (← links)
- (Q5560916) (← links)
- On uniquely colorable planar graphs (Q5565635) (← links)
- Arrow Diagrams are Line Digraphs (Q5576816) (← links)
- Reconstruction of Cacti (Q5578818) (← links)
- (Q5586070) (← links)
- (Q5589116) (← links)
- (Q5589118) (← links)
- Minimally strong digraphs (Q5596093) (← links)
- (Q5616727) (← links)