The following pages link to Iztok Peterin (Q279208):
Displaying 21 items.
- Distance formula for direct-co-direct product in the case of disconnected factors (Q5888905) (← links)
- Game chromatic number of Cartesian product graphs (Q5900078) (← links)
- The simultaneous fractional dimension of graph families (Q6079301) (← links)
- Large cliques in graphs with high chromatic number (Q6091811) (← links)
- On some metric properties of direct-co-direct product (Q6096252) (← links)
- Fractional matching preclusion numbers of Cartesian product graphs (Q6110597) (← links)
- Axiomatic characterization of the toll walk function of some graph classes (Q6132559) (← links)
- The list-coloring function of signed graphs (Q6136674) (← links)
- On distance-balanced generalized Petersen graphs (Q6192076) (← links)
- Roman domination in direct product graphs and rooted product graphs (Q6368159) (← links)
- On b-acyclic chromatic number of a graph (Q6401969) (← links)
- On Distance and Strong Metric Dimension of the Modular Product (Q6521311) (← links)
- Domination number of modular product graphs (Q6529097) (← links)
- The average Steiner \(( 3 , 2 )\)-eccentricity of trees (Q6559393) (← links)
- Resolving vertices of graphs with differences (Q6569070) (← links)
- On the complexity of local-equitable coloring in claw-free graphs with small degree (Q6616437) (← links)
- A note on the \(P_3\)-isolation number of a graph (Q6658909) (← links)
- Domination number of modular product graphs (Q6659779) (← links)
- On distance and strong metric dimension of the modular product (Q6661081) (← links)
- Convex Geometries yielded by Transit Functions (Q6731140) (← links)
- Grundy Packing Coloring of Graphs (Q6742570) (← links)
