The following pages link to Riste Škrekovski (Q181824):
Displaying 50 items.
- Orientations of graphs with maximum Wiener index (Q335342) (← links)
- Distances on nanotubical structures (Q338805) (← links)
- Improved bound on facial parity edge coloring (Q390304) (← links)
- (Q409419) (redirect page) (← links)
- Hyperbolic analogues of fullerenes on orientable surfaces (Q409420) (← links)
- On a conjecture about Wiener index in iterated line graphs of trees (Q409441) (← links)
- Brooks' theorem for generalized dart graphs (Q413285) (← links)
- Acyclic edge coloring of planar graphs with \(\varDelta\) colors (Q423967) (← links)
- Bipartizing fullerenes (Q427819) (← links)
- Some remarks on inverse Wiener index problem (Q444451) (← links)
- Sandwiching the (generalized) Randić index (Q479035) (← links)
- \(\ell\)-facial edge colorings of graphs (Q479043) (← links)
- On the Zagreb index inequality of graphs with prescribed vertex degrees (Q534355) (← links)
- Randić index and the diameter of a graph (Q627931) (← links)
- Some remarks on Wiener index of oriented graphs (Q668528) (← links)
- An inequality between the edge-Wiener index and the Wiener index of a graph (Q668722) (← links)
- Rooted level-disjoint partitions of Cartesian products (Q669354) (← links)
- (Q697074) (redirect page) (← links)
- Planar graphs without cycles of specific lengths (Q697075) (← links)
- Coloring face hypergraphs on surfaces (Q703607) (← links)
- The Wiener index in iterated line graphs (Q713319) (← links)
- Some results on Vizing's conjecture and related problems (Q714041) (← links)
- Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) (Q741736) (← links)
- Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs (Q777380) (← links)
- Distance based indices in nanotubical graphs. III (Q830871) (← links)
- Cyclic 7-edge-cuts in fullerene graphs (Q848197) (← links)
- Colorings of planar graphs with no rainbow faces (Q858112) (← links)
- The circular chromatic index of graphs of high girth (Q858677) (← links)
- On cube-free median graphs (Q864119) (← links)
- Four gravity results (Q864159) (← links)
- Lightness, heaviness and gravity (Q868366) (← links)
- The 7-cycle \(C_{7}\) is light in the family of planar graphs with minimum degree 5 (Q878637) (← links)
- Mapping planar graphs into the Coxeter graph (Q898148) (← links)
- A measure for a balanced workload and its extremal values (Q906433) (← links)
- Cyclic edge-cuts in fullerene graphs (Q937688) (← links)
- Facial colorings using Hall's theorem (Q966152) (← links)
- Distance constrained labelings of planar graphs with no short cycles (Q967308) (← links)
- Backbone colorings of graphs with bounded degree (Q968172) (← links)
- An improved linear bound on the number of perfect matchings in cubic graphs (Q976154) (← links)
- On generalized middle-level problem (Q985072) (← links)
- Injective colorings of planar graphs with few colors (Q1045050) (← links)
- Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor (Q1045075) (← links)
- Planar graphs without 3-, 7-, and 8-cycles are 3-choosable (Q1045077) (← links)
- The Grötzsch theorem for the hypergraph of maximal cliques (Q1292236) (← links)
- The Petersen graph is not 3-edge-colorable---a new proof (Q1398278) (← links)
- Quasi-median graphs, their generalizations, and tree-like equalities (Q1399693) (← links)
- On median graphs and median grid graphs (Q1567686) (← links)
- On list edge-colorings of subcubic graphs (Q1584301) (← links)
- An Euler-type formula for median graphs (Q1584314) (← links)
- Choosability of \(K_5\)-minor-free graphs (Q1584404) (← links)
