According to our database
1,
Tomaz Pisanski
authored at least 140 papers
between 1980 and 2024.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2024
Classification of Cubic Tricirculant Nut Graphs.
Electron. J. Comb., 2024
Vertex and Edge Orbits in Nut Graphs.
Electron. J. Comb., 2024
2022
The Sierpiński product of graphs.
Ars Math. Contemp., October, 2022
On singular signed graphs with nullspace spanned by a full vector: signed nut graphs.
Discuss. Math. Graph Theory, 2022
2020
A novel method for determining research groups from co-authorship network and scientific fields of authors.
Informatica (Slovenia), 2020
Existence of regular nut graphs for degree at most 11.
Discuss. Math. Graph Theory, 2020
Chiral Astral Realizations of Cyclic 3-Configurations.
Discret. Comput. Geom., 2020
Accepted Manuscripts - Yet Another Step to Reduce the Backlog.
Ars Math. Contemp., 2020
DOI - Digital Object Identifier.
Ars Math. Contemp., 2020
A new generalization of generalized Petersen graphs.
Art Discret. Appl. Math., 2020
2019
The Use of Collaboration Distance in Scheduling Conference Talks.
Informatica (Slovenia), 2019
Generalized Petersen graphs and Kronecker covers.
Discret. Math. Theor. Comput. Sci., 2019
Existence of $d$-regular nut graphs for $d$ at most 11.
CoRR, 2019
Plan S - A Golden Addition to the Diamond Open Access Publishing Model.
Ars Math. Contemp., 2019
Splittable and unsplittable graphs and configurations.
Ars Math. Contemp., 2019
Art Discret. Appl. Math., 2019
2018
Not every bipartite double cover is canonical.
Bull. ICA, 2018
Blacklists vs. Whitelists.
Ars Math. Contemp., 2018
A New Strategy to Tackle the Backlog.
Ars Math. Contemp., 2018
Combinatorial configurations, quasiline arrangements, and systems of curves on surfaces.
Ars Math. Contemp., 2018
The ADAM graph and its configuration.
Art Discret. Appl. Math., 2018
2017
Operations on Oriented Maps.
Symmetry, 2017
ADAM, An Offspring Journal is Here!
Ars Math. Contemp., 2017
Slovenian Discrete and Applied Mathematics Society.
Ars Math. Contemp., 2017
Vertex-transitive graphs and their arc-types.
Ars Math. Contemp., 2017
A novel characterization of cubic Hamiltonian graphs via the associated quartic graphs.
Ars Math. Contemp., 2017
2016
Polycyclic Movable 4-Configurations are Plentiful.
Discret. Comput. Geom., 2016
Which Haar graphs are Cayley graphs?
Electron. J. Comb., 2016
Ante Graovac and Chemical Graph Theory.
Ars Math. Contemp., 2016
2015
Protein alignment: Exact versus approximate. An illustration.
J. Comput. Chem., 2015
Genus of the Cartesian Product of Triangles.
Electron. J. Comb., 2015
DM=60 - A Surprise Conference.
Ars Math. Contemp., 2015
What do we publish in AMC?
Ars Math. Contemp., 2015
Is it time for electronic only?
Ars Math. Contemp., 2015
2014
On the Maximum Number of Independent Elements in Configurations of Points and Lines.
Discret. Comput. Geom., 2014
The curse of the impact factor.
Ars Math. Contemp., 2014
Kronecker covers, V-construction, unit-distance graphs and isometric point-circle configurations.
Ars Math. Contemp., 2014
Mathematical Chemistry Issue.
Ars Math. Contemp., 2014
2013
Generation of various classes of trivalent graphs.
Theor. Comput. Sci., 2013
A new approach to complex web site organization.
J. Inf. Sci., 2013
Hamiltonian cycles in I-graphs.
Electron. Notes Discret. Math., 2013
Medial Symmetry Type Graphs.
Electron. J. Comb., 2013
2012
Isomorphism Checking of I-graphs.
Graphs Comb., 2012
Open access strategy: Either-or.
Ars Math. Contemp., 2012
Unit distance representations of the Petersen graph in the plane.
Ars Comb., 2012
2011
Edge-transitive maps of low genus.
Ars Math. Contemp., 2011
2010
Novel graph distance matrix.
J. Comput. Chem., 2010
Distance-residual subgraphs.
Discret. Math., 2010
Products of unit distance graphs.
Discret. Math., 2010
Use of the Szeged index and the revised Szeged index for measuring network bipartivity.
Discret. Appl. Math., 2010
On the extremal values of ratios of number of paths.
Ars Math. Contemp., 2010
A note on enumeration of one-vertex maps.
Ars Math. Contemp., 2010
On the Computational Complexity of Degenerate Unit Distance Representations of Graphs.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010
2009
Hamilton cycles in graph bundles over a cycle with tree as a fibre.
Discret. Math., 2009
Edge-contributions of some topological indices and arboreality of molecular graphs.
Ars Math. Contemp., 2009
Counting edge-transitive, one-ended, three-connected planar maps with a given growth rate.
Ars Math. Contemp., 2009
2008
Growth of Edge-Homogeneous Tessellations.
SIAM J. Discret. Math., 2008
Multiple Kronecker covering graphs.
Eur. J. Comb., 2008
What is Ars Mathematica Contemporanea?
Ars Math. Contemp., 2008
2007
Semisymmetric graphs from polytopes.
J. Comb. Theory A, 2007
Oriented matroids and complete-graph embeddings on surfaces.
J. Comb. Theory A, 2007
Growth in Catacondensed Benzenoid Graphs.
J. Chem. Inf. Model., 2007
A classification of cubic bicirculants.
Discret. Math., 2007
Heuristic search for Hamilton cycles in cubic graphs.
Discret. Math., 2007
2006
Characterization of Complex Biological Systems by Matrix Invariants.
J. Comput. Biol., 2006
Small Triangle-Free Configurations of Points and Lines.
Discret. Comput. Geom., 2006
Erratum to "Reduction of symmetric configurations n<sub>3</sub>" [Discrete Appl. Math. 99 (1-3) (2000) 401 -411]
Discret. Appl. Math., 2006
2005
The edge-transitive but not vertex-transitive cubic graph on 112 vertices.
J. Graph Theory, 2005
The genus of the GRAY graph is 7.
Eur. J. Comb., 2005
2004
Algorithms for Drawing Polyhedra from 3-Connected Planar Graphs.
Informatica (Slovenia), 2004
Straight-ahead walks in Eulerian graphs.
Discret. Math., 2004
The 10-cages and derived configurations.
Discret. Math., 2004
On the orientable genus of the cartesian product of a complete regular tripartite graph with an even cycle.
Ars Comb., 2004
2003
Polycyclic configurations.
Eur. J. Comb., 2003
Discuss. Math. Graph Theory, 2003
Topological Graph Theory.
Proceedings of the Handbook of Graph Theory., 2003
2002
Strongly adjacency-transitive graphs and uniquely shift-transitive graphs.
Discret. Math., 2002
Growth in products of graphs.
Australas. J Comb., 2002
2001
An algorithm for <i>K</i>-convex closure and an application.
Int. J. Comput. Math., 2001
Interactive Conjecturing with Vega.
Proceedings of the Graphs and Discovery, 2001
2000
The Gray graph revisited.
J. Graph Theory, 2000
Characterizing Graph Drawing with Eigenvectors.
J. Chem. Inf. Comput. Sci., 2000
On Numerical Characterization of Cyclicity.
J. Chem. Inf. Comput. Sci., 2000
Counting Symmetric Configurations v<sub>3</sub>.
Discret. Appl. Math., 2000
1999
Weakly Flag-transitive Configurations and Half-arc-transitive Graphs.
Eur. J. Comb., 1999
1998
Another Infinite Sequence of Dense Triangle-Free Graphs.
Electron. J. Comb., 1998
A generalized ring spiral algorithm for coding fullerenes and other cubic polyhedra.
Proceedings of the Discrete Mathematical Chemistry, 1998
Foldedness in linear polymers: A difference between graphical and Euclidean distances.
Proceedings of the Discrete Mathematical Chemistry, 1998
1997
Isoperimetric Quotient for Fullerenes and Other Polyhedral Cages.
J. Chem. Inf. Comput. Sci., 1997
Recognizing Cartesian graph bundles.
Discret. Math., 1997
1996
Generating Fullerenes at Random.
J. Chem. Inf. Comput. Sci., 1996
1994
Homeomorphism of 2-Complexes is Graph Isomorphism Complete.
SIAM J. Comput., 1994
Rotagraphs and Their Generalizations.
J. Chem. Inf. Comput. Sci., 1994
Weights on Edges of Chemical Graphs Determined by Paths.
J. Chem. Inf. Comput. Sci., 1994
On the genus of the tensor product of graphs where one factor is a regular graph.
Discret. Math., 1994
Molecular Graph Eigenvectors for Molecular Coordinates.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994
1993
Computing the Diameter in Multiple-Loop Networks.
J. Algorithms, 1993
1992
Orientable quadrilateral embeddings of products of graphs.
Discret. Math., 1992
The non-orientable genus of some metacyclic groups.
Comb., 1992
1990
Embeddings of cartesian products of nearly bipartite graphs.
J. Graph Theory, 1990
An algorithm for tree-realizability of distance matrices.
Int. J. Comput. Math., 1990
1989
The Genus of the Product of a Group with an Abelian Group.
Eur. J. Comb., 1989
The genus of low rank hamiltonian groups.
Discret. Math., 1989
Universal commutator graphs.
Discret. Math., 1989
Vector representations of graphs.
Discret. Math., 1989
1988
Exotic <i>n</i>-universal graphs.
J. Graph Theory, 1988
Nonorientable Embeddings of Groups.
Eur. J. Comb., 1988
The Maximum Genus of Graph Bundles.
Eur. J. Comb., 1988
1986
The matching polynomial of a polygraph.
Discret. Appl. Math., 1986
1985
The cartesian product of three triangles can be embedded into a surface of genus 7.
Discret. Math., 1985
1983
Edge-colorability of graph bundles.
J. Comb. Theory B, 1983
1982
Nonorientable genus of cartesian products of regular graphs.
J. Graph Theory, 1982
Hamiltonian cycles in the cartesian product of a tree and a cycle.
Discret. Math., 1982
1981
A duality theorem for graph embeddings.
J. Graph Theory, 1981
Search for minimal trivalent cycle permutation graphs with girth nine.
Discret. Math., 1981
1980
Genus of cartesian products of regular bipartite graphs.
J. Graph Theory, 1980
Dual imbeddings and wrapped quasi-coverings of graphs.
Discret. Math., 1980
