The following pages link to Iztok Peterin (Q279208):
Displaying 50 items.
- A survey on the cyclic coloring and its relaxations (Q2214302) (← links)
- Independent transversal total domination versus total domination in trees (Q2214318) (← links)
- Unfolding cubes: nets, packings, partitions, chords (Q2215462) (← links)
- List 3-coloring graphs with no induced \(P_6 + rP_3\) (Q2223697) (← links)
- Changing and unchanging of the domination number of a graph: path addition numbers (Q2227098) (← links)
- On the star chromatic index of generalized Petersen graphs (Q2227104) (← links)
- \([1,k]\)-domination number of lexicographic products of graphs (Q2227955) (← links)
- From the strong differential to Italian domination in graphs (Q2238746) (← links)
- Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\) (Q2239024) (← links)
- A Steiner general position problem in graph theory (Q2245772) (← links)
- Toll convexity (Q2255809) (← links)
- The compared costs of domination location-domination and identification (Q2282469) (← links)
- Monotonic properties of collections of maximum independent sets of a graph (Q2314418) (← links)
- The \(b\)-chromatic index of direct product of graphs (Q2352788) (← links)
- Intervals and convex sets in strong product of graphs (Q2376077) (← links)
- Total dominating sets in maximal outerplanar graphs (Q2409534) (← links)
- Efficient closed domination in digraph products (Q2424797) (← links)
- Characterizing flag graphs and incuced subgraphs of Cartesian product graphs (Q2573719) (← links)
- Turán-type results for distance graphs in an infinitesimal plane layer (Q2632552) (← links)
- On three outer-independent domination related parameters in graphs (Q2656960) (← links)
- A note on the packing chromatic number of lexicographic products (Q2659160) (← links)
- Roman domination in direct product graphs and rooted product graphs (Q2671126) (← links)
- Maximum induced forests of product graphs (Q2683145) (← links)
- On b-acyclic chromatic number of a graph (Q2685280) (← links)
- Odd coloring of sparse graphs and planar graphs (Q2689480) (← links)
- Pre-hull number of Cartesian and strong graph products (Q2809934) (← links)
- Atoms and clique separators in graph products (Q2867539) (← links)
- On the b-chromatic number of some graph products (Q2915433) (← links)
- Some Steiner concepts on lexicographic products of graphs (Q2931926) (← links)
- Open k-monopolies in graphs: complexity and related concepts (Q2965978) (← links)
- Partitioning the vertex set of $G$ to make $G\,\Box\, H$ an efficient open domination graph (Q2965982) (← links)
- n-ary transit functions in graphs (Q2997592) (← links)
- NZ-flows in strong products of graphs (Q3057056) (← links)
- (Open) packing number of some graph products (Q3386621) (← links)
- Group distance magic labeling of direct product of graphs (Q3466847) (← links)
- (Q3517166) (← links)
- (Q3531295) (← links)
- Wiener index of strong product of graphs (Q4554806) (← links)
- (Q4591109) (← links)
- Recognizing generalized Sierpiński graphs (Q4988984) (← links)
- Incidence dimension and 2-packing number in graphs (Q5034794) (← links)
- The total co-independent domination number of some graph operations (Q5101866) (← links)
- The complexity of open k-monopolies in graphs for negative k (Q5106671) (← links)
- A note on bipartite graphs whose [1,k]-domination number equal to their number of vertices (Q5106724) (← links)
- A characterization of graphs with disjoint total dominating sets (Q5225045) (← links)
- Computing the (k-)monopoly number of direct product of graphs (Q5278637) (← links)
- Characterizing subgraphs of Hamming graphs (Q5311920) (← links)
- The security number of lexicographic products (Q5375880) (← links)
- (Q5397210) (← links)
- A charaterization of planar median graphs (Q5492684) (← links)
