Претрага
Резултати
Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It (✓) [2012]
Aboulker, Pierre; Radovanović, Marko![](/image/people_icon_ico.png)
![](/image/organisations_icon_ico.png)
![](/image/people_icon_ico.png)
![](/image/organisations_icon_ico.png)
Splitting necklaces, with constraints (✓) [2021]
Jojić, Duško; Panina, Gaiane; Živaljević, Rade![](/image/people_icon_ico.png)
![](/image/organisations_icon_ico.png)
Quasisymmetric Functions for Nestohedra (✓) [2017]
Grujić, Vladimir![](/image/people_icon_ico.png)
![](/image/organisations_icon_ico.png)
Planarity, colorability, and minor games [2008]
Hefetz D.; Krivelevich M.; Stojaković Miloš![](/image/people_icon_ico.png)
![](/image/organisations_icon_ico.png)
Improved Bounds on Sidon Sets via Lattice Packings of Simplices (✓) [2017]
Kovačević, Mladen![](/image/people_icon_ico.png)
![](/image/organisations_icon_ico.png)
Note on the Number of Two-Dimensional Threshold Functions [2011]
Žunić, Joviša![](/image/people_icon_ico.png)
![](/image/organisations_icon_ico.png)
A planarity criterion for graphs [2015]
Došen, Kosta![](/image/people_icon_ico.png)
![](/image/organisations_icon_ico.png)
![](/image/people_icon_ico.png)
![](/image/organisations_icon_ico.png)
Филтери
По типу