The following pages link to Janja Jerebic (Q412341):
Displaying 9 items.
- A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks (Q412342) (← links)
- Distance-balanced graphs (Q938213) (← links)
- The distinguishing chromatic number of Cartesian products of two complete graphs (Q973145) (← links)
- Characterizing \(r\)-perfect codes in direct products of two and three cycles (Q1041710) (← links)
- Guarding a subgraph as a tool in pursuit-evasion games (Q2062677) (← links)
- The distinguishing number of Cartesian products of complete graphs (Q2427541) (← links)
- On induced and isometric embeddings of graphs into the strong product of paths (Q2497473) (← links)
- On \(\ell\)-distance-balanced product graphs (Q2657092) (← links)
- Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem (Q5295414) (← links)
