The following pages link to Iztok Peterin (Q279208):
Displaying 50 items.
- Spectra of graphs and closed distance magic labelings (Q279209) (← links)
- A note on 3-Steiner intervals and betweenness (Q409389) (← links)
- The pre-hull number and lexicographic product (Q432717) (← links)
- Distance magic labeling and two products of graphs (Q497299) (← links)
- Resolvability and strong resolvability in the direct product of graphs (Q511842) (← links)
- Total coloring of planar graphs without adjacent short cycles (Q512886) (← links)
- On gated sets in graphs (Q515019) (← links)
- Graphs that are simultaneously efficient open domination and efficient closed domination graphs (Q516892) (← links)
- Hybrid evolutionary algorithm for the b-chromatic number (Q525060) (← links)
- Convex sets in lexicographic products of graphs (Q659762) (← links)
- Coloring chains for compression with uncertain priors (Q668010) (← links)
- Chromatic-choosability of hypergraphs with high chromatic number (Q668048) (← links)
- Hamming dimension of a graph-the case of Sierpiński graphs (Q691596) (← links)
- The induced path transit function and the Pasch axiom (Q726505) (← links)
- The \(b\)-chromatic index of a graph (Q745926) (← links)
- On the Roman domination subdivision number of a graph (Q782761) (← links)
- CPG graphs: some structural and hardness results (Q827595) (← links)
- Fast recognition of classes of almost-median graphs (Q864135) (← links)
- Recognizing Cartesian products in linear time (Q864136) (← links)
- A characterization of planar partial cubes (Q998403) (← links)
- Strongly distance-balanced graphs and graph products (Q1024301) (← links)
- Steiner intervals, geodesic intervals, and betweenness (Q1045107) (← links)
- A note on the thue chromatic number of lexicographic products of graphs (Q1649901) (← links)
- The \(b\)-chromatic number and related topics -- a survey (Q1682893) (← links)
- Spanning trails with maximum degree at most 4 in \(2K_2\)-free graphs (Q1684926) (← links)
- Coloring graphs to produce properly colored walks (Q1684944) (← links)
- On a theorem of Halin (Q1688265) (← links)
- Coloring points with respect to squares (Q1688853) (← links)
- Bounding the open \(k\)-monopoly number of strong product graphs (Q1692650) (← links)
- Cartesian products of directed graphs with loops (Q1709534) (← links)
- The median game (Q1751121) (← links)
- Almost self-centered median and chordal graphs (Q1758318) (← links)
- A forbidden subgraph characterization of some graph classes using betweenness axioms (Q1946665) (← links)
- Edge metric dimension of some graph operations (Q1988561) (← links)
- A note on coloring digraphs of large girth (Q2004076) (← links)
- The (vertex-)monochromatic index of a graph (Q2012896) (← links)
- Rainbow connection and graph products (Q2014711) (← links)
- On the relation between Wiener index and eccentricity of a graph (Q2045025) (← links)
- Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs (Q2045048) (← links)
- Note on the vertex-rainbow index of a graph (Q2048994) (← links)
- Protection of lexicographic product graphs (Q2062678) (← links)
- Disjoint cycles and \(2\)-factors with Fan-type condition in a graph (Q2075536) (← links)
- \(k\)-paths of \(k\)-trees (Q2089555) (← links)
- The fractional chromatic number of generalized cones over graphs (Q2138562) (← links)
- Geodesic transversal problem for join and lexicographic product of graphs (Q2140756) (← links)
- Critical independent sets of König-Egerváry graphs (Q2146733) (← links)
- Graphs with unique maximum packing of closed neighborhoods (Q2151212) (← links)
- Perfect Italian domination in graphs: complexity and algorithms (Q2161253) (← links)
- Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations (Q2181243) (← links)
- A note on Norine's antipodal-colouring conjecture (Q2185216) (← links)
