Riste Skrekovski

According to our database1, Riste Skrekovski authored at least 168 papers between 1998 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Odd decompositions and coverings of graphs.
Eur. J. Comb., 2021

2020
Remarks on Distance Based Topological Indices for ℓ-Apex Trees.
Symmetry, 2020

Trees with Minimum Weighted Szeged Index Are of a Large Diameter.
Symmetry, 2020

The structure of graphs with given number of blocks and the maximum Wiener index.
J. Comb. Optim., 2020

Eccentricity of networks with structural constraints.
Discuss. Math. Graph Theory, 2020

Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs.
Discret. Appl. Math., 2020

Variations on the Petersen Colouring Conjecture.
Electron. J. Comb., 2020

Maximal Wiener index for graphs with prescribed number of blocks.
Appl. Math. Comput., 2020

Redundant binary representations with rigorous trade-off between connectivity and locality.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

2019
Coverability of graph by three odd subgraphs.
J. Graph Theory, 2019

Facial unique-maximum colorings of plane graphs with restriction on big vertices.
Discret. Math., 2019

Maximum external Wiener index of graphs.
Discret. Appl. Math., 2019

Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs.
CoRR, 2019

On Extremal Graphs of Weighted Szeged Index.
CoRR, 2019

Unicyclic graphs with the maximal value of Graovac-Pisanski index.
Ars Math. Contemp., 2019

Total positivity of Toeplitz matrices of recursive hypersequences.
Ars Math. Contemp., 2019

Graphs with a given diameter that maximise the Wiener index.
Appl. Math. Comput., 2019

Trees with the maximal value of Graovac-Pisanski index.
Appl. Math. Comput., 2019

On the minimum distance in a <i>k</i>-vertex set in a graph.
Appl. Math. Comput., 2019

An inequality between variable wiener index and variable szeged index.
Appl. Math. Comput., 2019

Remarks on Multiplicative Atom-Bond Connectivity Index.
IEEE Access, 2019

2018
On vertex-parity edge-colorings.
J. Comb. Optim., 2018

Broadcasting multiple messages in the 1-in port model in optimal time.
J. Comb. Optim., 2018

Graphs preserving total distance upon vertex removal.
Electron. Notes Discret. Math., 2018

A counterexample to a conjecture on facial unique-maximal colorings.
Discret. Appl. Math., 2018

Graphs whose Wiener index does not change when a specific vertex is removed.
Discret. Appl. Math., 2018

On facial unique-maximum (edge-)coloring.
Discret. Appl. Math., 2018

Extending Perfect Matchings to Gray Codes with Prescribed Ends.
Electron. J. Comb., 2018

Graphs preserving Wiener index upon vertex removal.
Appl. Math. Comput., 2018

Modelling simultaneous broadcasting by level-disjoint partitions.
Appl. Math. Comput., 2018

On a conjecture about the ratio of Wiener index in iterated line graphs.
Art Discret. Appl. Math., 2018

2017
Remarks on maximum atom-bond connectivity index with given graph parameters.
Discret. Appl. Math., 2017

Relative edge betweenness centrality.
Ars Math. Contemp., 2017

A note on acyclic number of planar graphs.
Ars Math. Contemp., 2017

On the minimum value of sum-Balaban index.
Appl. Math. Comput., 2017

Remarks on the Graovac-Ghorbani index of bipartite graphs.
Appl. Math. Comput., 2017

On the difference between the Szeged and the Wiener index.
Appl. Math. Comput., 2017

Leapfrog fullerenes and Wiener index.
Appl. Math. Comput., 2017

2016
Closeness centralization measure for two-mode data of prescribed sizes.
Netw. Sci., 2016

Star Edge Coloring of Some Classes of Graphs.
J. Graph Theory, 2016

Mapping planar graphs into the Coxeter graph.
Discret. Math., 2016

Orientations of graphs with maximum Wiener index.
Discret. Appl. Math., 2016

A measure for a balanced workload and its extremal values.
Discret. Appl. Math., 2016

Remarks on the maximum atom-bond connectivity index of graphs with given parameters.
CoRR, 2016

Mathematical aspects of Wiener index.
Ars Math. Contemp., 2016

Odd edge-colorability of subcubic graphs.
Ars Math. Contemp., 2016

Mathematical aspects of fullerenes.
Ars Math. Contemp., 2016

A search for the minimum value of Balaban index.
Appl. Math. Comput., 2016

Digraphs with large maximum Wiener index.
Appl. Math. Comput., 2016

Some remarks on Wiener index of oriented graphs.
Appl. Math. Comput., 2016

Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model.
Proceedings of the Combinatorial Optimization and Applications, 2016

2015
Centralization of transmission in networks.
Discret. Math., 2015

l-facial edge colorings of graphs.
Discret. Appl. Math., 2015

Group centralization of network indices.
Discret. Appl. Math., 2015

Sandwiching the (generalized) Randić index.
Discret. Appl. Math., 2015

Counterexamples to a conjecture on injective colorings.
Ars Math. Contemp., 2015

Odd edge coloring of graphs.
Ars Math. Contemp., 2015

Comparing the irregularity and the total irregularity of graphs.
Ars Math. Contemp., 2015

An inequality between the edge-Wiener index and the Wiener index of a graph.
Appl. Math. Comput., 2015

Rooted level-disjoint partitions of Cartesian products.
Appl. Math. Comput., 2015

2014
Replication in critical graphs and the persistence of monomial ideals.
J. Comb. Theory, Ser. A, 2014

Strong parity vertex coloring of plane graphs.
Discret. Math. Theor. Comput. Sci., 2014

Strong edge-coloring of planar graphs.
Discret. Math., 2014

Relationship between the edge-Wiener index and the Gutman index of a graph.
Discret. Appl. Math., 2014

Complete solution of equation W(L<sup>3</sup>(T))=W(T) for the Wiener index of iterated line graphs of trees.
Discret. Appl. Math., 2014

Sufficient sparseness conditions for G<sup>2</sup> to be (Δ+1)-choosable, when Δ≥5.
Discret. Appl. Math., 2014

On the connectivity of Cartesian product of graphs.
Ars Math. Contemp., 2014

Modeling acquaintance networks based on balance theory.
Int. J. Appl. Math. Comput. Sci., 2014

Choosability of the square of a planar graph with maximum degree four.
Australas. J Comb., 2014

Wiener index of generalized 4-stars and of their quadratic line graphs.
Australas. J Comb., 2014

2013
On the mutually independent Hamiltonian cycles in faulty hypercubes.
Inf. Sci., 2013

Line graph operation and small worlds.
Inf. Process. Lett., 2013

Linear time construction of a compressed Gray code.
Eur. J. Comb., 2013

A bound on the number of perfect matchings in Klee-graphs.
Discret. Math. Theor. Comput. Sci., 2013

Improved bound on facial parity edge coloring.
Discret. Math., 2013

Wiener index of iterated line graphs of trees homeomorphic to.
Discret. Math., 2013

Wiener index of iterated line graphs of trees homeomorphic to the claw <i>K</i><sub>1, 3</sub>.
Ars Math. Contemp., 2013

On a variation of the Randíc index.
Australas. J Comb., 2013

2012
Queue Layouts of Hypercubes.
SIAM J. Discret. Math., 2012

Brooksʼ Theorem for generalized dart graphs.
Inf. Process. Lett., 2012

Bipartizing fullerenes.
Eur. J. Comb., 2012

Parity vertex colorings of binomial trees.
Discuss. Math. Graph Theory, 2012

Hyperbolic analogues of fullerenes on orientable surfaces.
Discret. Math., 2012

On a conjecture about Wiener index in iterated line graphs of trees.
Discret. Math., 2012

Some results on Vizing's conjecture and related problems.
Discret. Appl. Math., 2012

The Wiener index in iterated line graphs.
Discret. Appl. Math., 2012

Acyclic edge coloring of planar graphs with Δ colors.
Discret. Appl. Math., 2012

Some remarks on inverse Wiener index problem.
Discret. Appl. Math., 2012

A note on Zagreb indices inequality for trees and unicyclic graphs.
Ars Math. Contemp., 2012

2011
On the 2-Resonance of Fullerenes.
SIAM J. Discret. Math., 2011

Graphs with Odd Cycle Lengths 5 and 7 are 3-Colorable.
SIAM J. Discret. Math., 2011

Graphs with Two Crossings Are 5-Choosable.
SIAM J. Discret. Math., 2011

On the queue-number of the hypercube.
Electron. Notes Discret. Math., 2011

Randić index and the diameter of a graph.
Eur. J. Comb., 2011

On the Zagreb index inequality of graphs with prescribed vertex degrees.
Discret. Appl. Math., 2011

2010
3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles.
SIAM J. Discret. Math., 2010

Non-rainbow colorings of 3-, 4- and 5-connected plane graphs.
J. Graph Theory, 2010

On generalized middle-level problem.
Inf. Sci., 2010

Facial colorings using Hall's Theorem.
Eur. J. Comb., 2010

An improved linear bound on the number of perfect matchings in cubic graphs.
Eur. J. Comb., 2010

An improved bound on the largest induced forests for triangle-free planar graphs.
Discret. Math. Theor. Comput. Sci., 2010

Backbone colorings of graphs with bounded degree.
Discret. Appl. Math., 2010

Dichotomy for Coloring of Dart Graphs.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009
Backbone Colorings and Generalized Mycielski Graphs.
SIAM J. Discret. Math., 2009

k-Chromatic Number of Graphs on Surfaces.
SIAM J. Discret. Math., 2009

Long cycles in hypercubes with distant faulty vertices.
Discret. Math. Theor. Comput. Sci., 2009

Gray Codes Avoiding Matchings.
Discret. Math. Theor. Comput. Sci., 2009

Homomorphisms of triangle-free graphs without a K<sub>5</sub>-minor.
Discret. Math., 2009

Injective colorings of planar graphs with few colors.
Discret. Math., 2009

Planar graphs without 3-, 7-, and 8-cycles are 3-choosable.
Discret. Math., 2009

Distance constrained labelings of planar graphs with no short cycles.
Discret. Appl. Math., 2009

Gray Code Compression.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008
Total-Coloring of Plane Graphs with Maximum Degree Nine.
SIAM J. Discret. Math., 2008

Cycles Intersecting Edge-Cuts of Prescribed Sizes.
SIAM J. Discret. Math., 2008

3-Facial Coloring of Plane Graphs.
SIAM J. Discret. Math., 2008

Planar Graphs of Odd-Girth at Least 9 are Homomorphic to the Petersen Graph.
SIAM J. Discret. Math., 2008

List-Coloring Squares of Sparse Subcubic Graphs.
SIAM J. Discret. Math., 2008

Coloring squares of planar graphs with girth six.
Eur. J. Comb., 2008

2007
A Generalization of Kotzig's Theorem and Its Application.
SIAM J. Discret. Math., 2007

<i>T</i>-joins intersecting small edge-cuts in graphs.
J. Graph Theory, 2007

The circular chromatic index of graphs of high girth.
J. Comb. Theory, Ser. B, 2007

Cyclic, diagonal and facial colorings - a missing case.
Eur. J. Comb., 2007

The 7-cycle C<sub>7</sub> is light in the family of planar graphs with minimum degree 5.
Discret. Math., 2007

Lightness, heaviness and gravity.
Discret. Math., 2007

Four gravity results.
Discret. Math., 2007

On cube-free median graphs.
Discret. Math., 2007

2006
Construction of Large Graphs with No Optimal Surjective L(2, 1)-Labelings.
SIAM J. Discret. Math., 2006

A Theorem About a Contractible and Light Edge.
SIAM J. Discret. Math., 2006

The last excluded case of Dirac's map-color theorem for choosability.
J. Graph Theory, 2006

Roots of cube polynomials of median graphs.
J. Graph Theory, 2006

A map colour theorem for the union of graphs.
J. Comb. Theory, Ser. B, 2006

3-facial colouring of plane graphs
CoRR, 2006

Colorings Of Plane Graphs With No Rainbow Faces.
Comb., 2006

2005
A Brooks-Type Theorem for the Generalized List T-Coloring.
SIAM J. Discret. Math., 2005

Nordhaus-Gaddum-type Theorems for decompositions into many parts.
J. Graph Theory, 2005

Cyclic, diagonal and facial colorings.
Eur. J. Comb., 2005

Coloring face hypergraphs on surfaces.
Eur. J. Comb., 2005

Nowhere-zero 3-flows in abelian Cayley graphs.
Discret. Math., 2005

Generalized list T-colorings of cycles.
Discret. Appl. Math., 2005

2004
Planar graph colorings without short monochromatic cycles.
J. Graph Theory, 2004

Subdivisions of large complete bipartite graphs and long induced paths in <i>k</i>-connected graphs.
J. Graph Theory, 2004

A revival of the girth conjecture.
J. Comb. Theory, Ser. B, 2004

Borodin's conjecture on diagonal coloring is false.
Eur. J. Comb., 2004

Heavy paths, light stars, and big melons.
Discret. Math., 2004

2003
A Theorem about the Channel Assignment Problem.
SIAM J. Discret. Math., 2003

Light subgraphs in planar graphs of minimum degree 4 and edge-degree 9.
J. Graph Theory, 2003

A theorem on integer flows on cartesian products of graphs.
J. Graph Theory, 2003

Quasi-median graphs, their generalizations, and tree-like equalities.
Eur. J. Comb., 2003

Hajós' theorem for list colorings of hypergraphs.
Discuss. Math. Graph Theory, 2003

The Petersen graph is not 3-edge-colorable--a new proof.
Discret. Math., 2003

The Cube Polynomial and its Derivatives: the Case of Median Graphs.
Electron. J. Comb., 2003

2002
On the critical point-arboricity graphs.
J. Graph Theory, 2002

Tiled partial cubes.
J. Graph Theory, 2002

Planar Graphs Without Cycles of Specific Lengths.
Eur. J. Comb., 2002

2001
Cubes polynomial and its derivatives.
Electron. Notes Discret. Math., 2001

Gallai's innequality for critical graphs of reducible hereditary properties.
Discuss. Math. Graph Theory, 2001

Two relations for median graphs.
Discret. Math., 2001

Nowhere-zero k-flows of Supergraphs.
Electron. J. Comb., 2001

A note on choosability with separation for planar graphs.
Ars Comb., 2001

2000
List improper colorings of planar graphs with prescribed girth.
Discret. Math., 2000

On median graphs and median grid graphs.
Discret. Math., 2000

1999
Graphs of degree 4 are 5-edge-choosable.
J. Graph Theory, 1999

A Grötzsch-Type Theorem For List Colourings With Impropriety One.
Comb. Probab. Comput., 1999

The Grötzsch Theorem for the Hypergraph of Maximal Cliques.
Electron. J. Comb., 1999

1998
Choosability of K<sub>5</sub>-minor-free graphs.
Discret. Math., 1998

An Euler-type formula for median graphs.
Discret. Math., 1998

On list edge-colorings of subcubic graphs.
Discret. Math., 1998

List Total Colourings of Graphs.
Comb. Probab. Comput., 1998


  Loading...