The following pages link to Tomaž Pisanski (Q282216):
Displaying 50 items.
- Isomorphism checking of \(I\)-graphs (Q1928286) (← links)
- Multilaterals in configurations (Q1943357) (← links)
- Dilation coefficient, plane-width, and resolution coefficient of graphs (Q1950340) (← links)
- Counting symmetric configurations \(v_3\) (Q1962053) (← links)
- New bounds on the existence of \((n_5)\) and \((n_6)\) configurations: the Grünbaum calculus revisited (Q2099675) (← links)
- On singular signed graphs with nullspace spanned by a full vector: signed nut graphs (Q2158206) (← links)
- Point-ellipse configurations and related topics (Q2170458) (← links)
- Chiral astral realizations of cyclic 3-configurations (Q2197699) (← links)
- Universal commutator graphs (Q2276972) (← links)
- The genus of low rank Hamiltonian groups (Q2276973) (← links)
- Existence of regular nut graphs for degree at most 11 (Q2296003) (← links)
- Operations on oriented maps (Q2333458) (← links)
- Generalized cages (Q2341070) (← links)
- Sizes of pentagonal clusters in fullerenes (Q2402936) (← links)
- Small triangle-free configurations of points and lines (Q2492646) (← links)
- An algorithm for<i>K</i>-convex closure and an application (Q2752262) (← links)
- The remarkable generalized Petersen graph \(G(8,3)\) (Q2777495) (← links)
- On description of biological sequences by spectral properties of line distance matrices (Q2837829) (← links)
- All generalized Petersen graphs are unit-distance graphs (Q2890875) (← links)
- HL-index of a graph (Q2892011) (← links)
- A census of edge-transitive planar tilings (Q2895345) (← links)
- Configurations from a Graphical Viewpoint (Q2898356) (← links)
- Kronecker covers, V-construction, unit-distance graphs and isometric point-circle configurations (Q2940087) (← links)
- Strong Traces Model of Self-Assembly Polypeptide Structures (Q2975293) (← links)
- (Q2975307) (← links)
- On the Computational Complexity of Degenerate Unit Distance Representations of Graphs (Q3000515) (← links)
- Applying Burnside's Lemma to a One-Dimensional Escher Problem (Q3018979) (← links)
- On the extremal values of ratios of number of paths (Q3085030) (← links)
- (Q3139290) (← links)
- (Q3144336) (← links)
- Combinatorial configurations, quasiline arrangements, and systems of curves on surfaces (Q3174797) (← links)
- Geometric “Floral” Configurations (Q3182683) (← links)
- Edge-contributions of some topological indices and arboreality of molecular graphs (Q3184284) (← links)
- (Q3184814) (← links)
- (Q3208690) (← links)
- Edge-transitive maps of low genus (Q3225734) (← links)
- (Q3323992) (← links)
- (Q3325750) (← links)
- (Q3330393) (← links)
- (Q3333058) (← links)
- Embeddings of cartesian products of nearly bipartite graphs (Q3353035) (← links)
- (Q3407101) (← links)
- An algorithm for tree-realizability of distance matrices<sup>∗</sup> (Q3477951) (← links)
- Counting edge-transitive, one-ended, three-connected planar maps with a given growth rate (Q3552330) (← links)
- A note on enumeration of one-vertex maps (Q3586195) (← links)
- (Q3649431) (← links)
- (Q3656226) (← links)
- (Q3663323) (← links)
- (Q3665132) (← links)
- (Q3665146) (← links)
