The following pages link to Dejan Delić (Q231150):
Displaying 21 items.
- Distinguishing number and adjacency properties (Q543989) (← links)
- Upper signed \(k\)-domination in a general graph (Q765509) (← links)
- All countable monoids embed into the monoid of the infinite random graph (Q960939) (← links)
- The model companion of width-two orders (Q1267599) (← links)
- The monoid of the random graph (Q1576305) (← links)
- Generalized pigeonhole properties of graphs and oriented graphs (Q1612756) (← links)
- Decidable locally finite discriminator varieties arising from dihedral varieties of groups (Q1779462) (← links)
- (Q1882141) (redirect page) (← links)
- On a problem of Cameron's on inexhaustible graphs (Q1882142) (← links)
- The endomorphism monoid of the random graph has uncountably many ideals. (Q1882669) (← links)
- A note on orientations of the infinite random graph (Q1883602) (← links)
- A finer reduction of constraint problems to digraphs (Q3460423) (← links)
- A Pigeonhole Property for Relational Structures (Q4264540) (← links)
- (Q4583875) (← links)
- Tournaments and Orders with the Pigeonhole Property (Q4761342) (← links)
- SOLUTION TO A PROBLEM OF KUBLANOVSKY AND SAPIR (Q4786292) (← links)
- A finitely axiomatizable undecidable equational theory with recursively solvable word problems (Q4955722) (← links)
- (Q4982914) (← links)
- On the Reduction of the CSP Dichotomy Conjecture to Digraphs (Q5415454) (← links)
- Distinguishing homomorphisms of infinite graphs (Q5499933) (← links)
- Finite bases for flat graph algebras (Q5956274) (← links)
