pith. sign in

Riste \v{S}krekovski

Identifiers

  • name variant Riste \v{S}krekovski 0.60 · backfill

Papers (25)

  1. Counting geodesic paths in graphs math.CO · 2026 · author #3
  2. The structure of graphs with given number of blocks and the maximum Wiener index cs.DM · 2019 · author #5
  3. Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs cs.DM · 2019 · author #4
  4. On Extremal Graphs of Weighted Szeged Index math.CO · 2019 · author #4
  5. Lah numbers and Lindstr\"om's lemma math.CO · 2017 · author #2
  6. A counterexample to a conjecture on facial unique-maximal colorings math.CO · 2017 · author #3
  7. On the Clar Number of Benzenoid Graphs math.CO · 2017 · author #3
  8. On facial unique-maximum (edge-)coloring math.CO · 2017 · author #4
  9. On the minimum value of sum-Balaban index math.CO · 2017 · author #3
  10. Remarks on the maximum atom-bond connectivity index of graphs with given parameters math.CO · 2016 · author #3
  11. Remarks on the Graovac-Ghorbani index of bipartite graphs math.CO · 2016 · author #3
  12. Closeness Centralization Measure for Two-mode Data of Prescribed Sizes math.CO · 2016 · author #3
  13. On the difference between the Szeged and Wiener index math.CO · 2016 · author #5
  14. Mathematical aspects of Wiener index math.CO · 2015 · author #2
  15. Sandwiching saturation number of fullerene graphs math.CO · 2014 · author #3
  16. Strong edge coloring of subcubic bipartite graphs math.CO · 2013 · author #4
  17. Star edge coloring of some classes of graphs math.CO · 2013 · author #5
  18. Choosability of the square of a planar graph with maximum degree four math.CO · 2013 · author #3
  19. Sufficient sparseness conditions for G^2 to be (\Delta+1)-choosable, when \Delta\ge5 math.CO · 2013 · author #2
  20. Improved bound on facial parity edge coloring math.CO · 2013 · author #2
  21. Strong edge coloring of planar graphs math.CO · 2013 · author #4
  22. l-facial edge colorings of graphs math.CO · 2013 · author #4
  23. Replication in critical graphs and the persistence of monomial ideals math.CO · 2013 · author #3
  24. Euler's idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees math.CO · 2012 · author #2
  25. Graphs with two crossings are 5-choosable math.CO · 2011 · author #3

Mentions

  • 1510.00800 #2 · backfill · confidence 0.70 Riste \v{S}krekovski
  • 1405.2197 #3 · backfill · confidence 0.70 Riste \v{S}krekovski
  • 1311.6668 #4 · backfill · confidence 0.70 Riste \v{S}krekovski
  • 1307.1242 #5 · backfill · confidence 0.70 Riste \v{S}krekovski
  • 1303.5156 #3 · backfill · confidence 0.70 Riste \v{S}krekovski
  • 1303.5136 #2 · backfill · confidence 0.70 Riste \v{S}krekovski
  • 1303.4593 #2 · backfill · confidence 0.70 Riste \v{S}krekovski
  • 1303.4580 #4 · backfill · confidence 0.70 Riste \v{S}krekovski
  • 1303.4346 #4 · backfill · confidence 0.70 Riste \v{S}krekovski
  • 1301.6983 #3 · backfill · confidence 0.70 Riste \v{S}krekovski
  • 1210.6335 #2 · backfill · confidence 0.70 Riste \v{S}krekovski
  • 1103.1801 #3 · backfill · confidence 0.70 Riste \v{S}krekovski

Frequent Coauthors