# Search results for: Iztok Peterin

Discussiones Mathematicae Graph Theory > 2017 > 38 > 1 > 287-299

Discrete Applied Mathematics > 2018 > 235 > C > 184-201

Discrete Applied Mathematics > 2017 > 217 > P3 > 613-621

Discrete Mathematics > 2016 > 339 > 7 > 1915-1923

Results in Mathematics > 2017 > 71 > 1-2 > 509-526

*G*, a vertex $${w \in V(G)}$$ w ∈ V ( G ) distinguishes two different vertices

*u*,

*v*of

*G*if the distances between

*w*and

*u*, and between

*w*and

*v*are different. Moreover,

*w*strongly resolves the pair

*u*,

*v*if there exists some shortest

*u*−

*w*path containing

*v*or some shortest

*v*−

*w*path containing

*u*. A set

*W*of vertices is a (strong) metric generator for

*G*if every pair of...

Bulletin of the Malaysian Mathematical Sciences Society > 2016 > 39 > 1 > 123-134

*I*satisfies the Pasch axiom were characterized by Chepoi in 1994. In this...

Discrete Applied Mathematics > 2015 > 190-191 > Complete > 109-117

Discrete Optimization > 2015 > 17 > Complete > 80-88

Journal of Heuristics > 2015 > 21 > 4 > 501-521

Graphs and Combinatorics > 2015 > 31 > 5 > 1125-1136

Bulletin of the Malaysian Mathematical Sciences Society > 2015 > 38 > 4 > 1375-1392

Graphs and Combinatorics > 2014 > 30 > 3 > 591-607

*G*is called a rainbow path if all its edges have pairwise different colors. Then

*G*is rainbow connected if there exists a rainbow path between every pair of vertices of

*G*and the least number of colors needed to obtain a rainbow connected graph is the rainbow connection number. If we demand that there must exist a shortest rainbow path between every pair of vertices,...

Discrete Mathematics > 2013 > 313 > 8 > 951-958

European Journal of Combinatorics > 2013 > 34 > 2 > 460-473

Graphs and Combinatorics > 2013 > 29 > 3 > 705-714

Discrete Mathematics > 2012 > 312 > 14 > 2153-2157

Graphs and Combinatorics > 2012 > 28 > 1 > 77-84

*J*-convex (alias induced path convex) sets of lexicographic products of graphs are characterized. The geodesic case in particular rectifies Theorem 3.1 in Canoy and Garces (Graphs Combin 18(4):787–793, 2002).

Discrete Mathematics > 2011 > 311 > 22 > 2601-2609

Journal of Graph Theory > 64 > 4 > 267 - 276

*G*

_{1}

*⊠ G*

_{2}of

*G*

_{1}and

*G*

_{2}is ℤ

_{3}‐flow contractible if and only if

*G*

_{1}

*⊠ G*

_{2}is not

*T⊠ K*

_{2}, where

*T*is a tree (we call

*T⊠ K*

_{2}a

*K*

_{4}‐tree). It follows that

*G*

_{1}

*⊠ G*

_{2}admits an NZ 3 ‐flow unless

*G*

_{1}

*⊠ G*

_{2}is a

*K*

_{4}‐tree. We also give a constructive proof that yields a polynomial algorithm whose output is an NZ 3‐flow if

*G*

_{1}

*⊠ G*

_{2}is not a

*K*

_{4}‐tree, and an NZ 4‐flow otherwise. © 2009 Wiley Periodicals,...

Discussiones Mathematicae Graph Theory > 2010 > 30 > 4 > 671-685