Tomaz Pisanski

Graphs Comb., April, 2026

2025

Polycyclic geometric realizations of the Gray configuration.

[BibT_eX]

[DOI]

Australas. J Comb., October, 2025

Towards a format for describing networks / 2. Format elements.

[BibT_eX]

[DOI]

CoRR, May, 2025

Towards a format for describing networks / 1. Networks and knowledge graphs.

[BibT_eX]

[DOI]

CoRR, May, 2025

The Gray graph is a unit-distance graph.

[BibT_eX]

[DOI]

Art Discret. Appl. Math., 2025

2024

Classification of Cubic Tricirculant Nut Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2024

On a New $(21_4)$ Polycyclic Configuration.

[BibT_eX]

[DOI]

Electron. J. Comb., 2024

Vertex and Edge Orbits in Nut Graphs.

[BibT_eX]

[DOI]

Nino Basic

Electron. J. Comb., 2024

2022

The Sierpiński product of graphs.

[BibT_eX]

[DOI]

Ars Math. Contemp., October, 2022

On singular signed graphs with nullspace spanned by a full vector: signed nut graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2022

2020

A novel method for determining research groups from co-authorship network and scientific fields of authors.

[BibT_eX]

[DOI]

Mark Pisanski

Jan Pisanski

Informatica (Slovenia), 2020

Existence of regular nut graphs for degree at most 11.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2020

Chiral Astral Realizations of Cyclic 3-Configurations.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2020

Accepted Manuscripts - Yet Another Step to Reduce the Backlog.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2020

ORCID iD.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2020

DOI - Digital Object Identifier.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2020

A new generalization of generalized Petersen graphs.

[BibT_eX]

[DOI]

Katarína Jasencáková

Robert Jajcay

Art Discret. Appl. Math., 2020

2019

The Use of Collaboration Distance in Scheduling Conference Talks.

[BibT_eX]

[DOI]

Jan Pisanski

Informatica (Slovenia), 2019

Generalized Petersen graphs and Kronecker covers.

[BibT_eX]

[DOI]

Matjaz Krnc

Discret. Math. Theor. Comput. Sci., 2019

Existence of $d$-regular nut graphs for $d$ at most 11.

[BibT_eX]

[DOI]

CoRR, 2019

Where Do We Stand?

[BibT_eX]

[DOI]

Ars Math. Contemp., 2019

Plan S - A Golden Addition to the Diamond Open Access Publishing Model.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2019

Splittable and unsplittable graphs and configurations.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2019

Regular antilattices.

[BibT_eX]

[DOI]

Art Discret. Appl. Math., 2019

2018

Not every bipartite double cover is canonical.

[BibT_eX]

[DOI]

Bull. ICA, 2018

Vladimir Batagelj is 70.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2018

Salami-Slicing Research.

[BibT_eX]

[DOI]

Marston D. E. Conder

Ars Math. Contemp., 2018

Blacklists vs. Whitelists.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2018

A New Strategy to Tackle the Backlog.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2018

Combinatorial configurations, quasiline arrangements, and systems of curves on surfaces.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2018

The ADAM graph and its configuration.

[BibT_eX]

[DOI]

Art Discret. Appl. Math., 2018

2017

Operations on Oriented Maps.

[BibT_eX]

[DOI]

Gordon I. Williams

Symmetry, 2017

ADAM, An Offspring Journal is Here!

[BibT_eX]

[DOI]

Ars Math. Contemp., 2017

Slovenian Discrete and Applied Mathematics Society.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2017

Indecent Proposals.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2017

Petra Šparl Award.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2017

Vertex-transitive graphs and their arc-types.

[BibT_eX]

[DOI]

Marston D. E. Conder

Ars Math. Contemp., 2017

A novel characterization of cubic Hamiltonian graphs via the associated quartic graphs.

[BibT_eX]

[DOI]

Simona Bonvicini

Ars Math. Contemp., 2017

2016

Polycyclic Movable 4-Configurations are Plentiful.

[BibT_eX]

[DOI]

Jill R. Faudree

Discret. Comput. Geom., 2016

Which Haar graphs are Cayley graphs?

[BibT_eX]

[DOI]

István Estélyi

Electron. J. Comb., 2016

Q1.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2016

The '2n - 1 rule'.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2016

8ECM.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2016

Ante Graovac and Chemical Graph Theory.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2016

2015

Protein alignment: Exact versus approximate. An illustration.

[BibT_eX]

[DOI]

J. Comput. Chem., 2015

Genus of the Cartesian Product of Triangles.

[BibT_eX]

[DOI]

Michal Kotrbcík

Electron. J. Comb., 2015

Generalized Cages.

[BibT_eX]

[DOI]

Marko Boben

Robert Jajcay

Electron. J. Comb., 2015

DM=60 - A Surprise Conference.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2015

What do we publish in AMC?

[BibT_eX]

[DOI]

Ars Math. Contemp., 2015

Coping with backlog.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2015

Is it time for electronic only?

[BibT_eX]

[DOI]

Ars Math. Contemp., 2015

The clone cover.

[BibT_eX]

[DOI]

Aleksander Malnic

Ars Math. Contemp., 2015

Editorial.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2015

2014

On the Maximum Number of Independent Elements in Configurations of Points and Lines.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

The curse of the impact factor.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2014

Kronecker covers, V-construction, unit-distance graphs and isometric point-circle configurations.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2014

Mathematical Chemistry Issue.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2014

2013

Generation of various classes of trivalent graphs.

[BibT_eX]

[DOI]

Gunnar Brinkmann

Nicolas Van Cleemput

Theor. Comput. Sci., 2013

A new approach to complex web site organization.

[BibT_eX]

[DOI]

Jan Pisanski

Maja Zumer

J. Inf. Sci., 2013

Hamiltonian cycles in I-graphs.

[BibT_eX]

[DOI]

Simona Bonvicini

Electron. Notes Discret. Math., 2013

Medial Symmetry Type Graphs.

[BibT_eX]

[DOI]

Isabel Hubard

María del Río Francos

Alen Orbanic

Electron. J. Comb., 2013

Features of growth.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2013

2012

Isomorphism Checking of I-graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2012

Open access strategy: Either-or.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2012

The next step.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2012

HL-index of a graph.

[BibT_eX]

[DOI]

Gasper Jaklic

Ars Math. Contemp., 2012

Unit distance representations of the Petersen graph in the plane.

[BibT_eX]

Ars Comb., 2012

2011

Edge-transitive maps of low genus.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2011

2010

Novel graph distance matrix.

[BibT_eX]

[DOI]

J. Comput. Chem., 2010

Distance-residual subgraphs.

[BibT_eX]

[DOI]

Primoz Luksic

Discret. Math., 2010

Preface.

[BibT_eX]

[DOI]

Discret. Math., 2010

Products of unit distance graphs.

[BibT_eX]

[DOI]

Discret. Math., 2010

Use of the Szeged index and the revised Szeged index for measuring network bipartivity.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

On the extremal values of ratios of number of paths.

[BibT_eX]

[DOI]

Damir Vukicevic

Ars Math. Contemp., 2010

A note on enumeration of one-vertex maps.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2010

The Printed Edition.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2010

The scope.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2010

On the Computational Complexity of Degenerate Unit Distance Representations of Graphs.

[BibT_eX]

[DOI]

Jan Kratochvíl

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009

Hamilton cycles in graph bundles over a cycle with tree as a fibre.

[BibT_eX]

[DOI]

Discret. Math., 2009

Edge-contributions of some topological indices and arboreality of molecular graphs.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2009

Breaking the cycle.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2009

Counting edge-transitive, one-ended, three-connected planar maps with a given growth rate.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2009

2008

Growth of Edge-Homogeneous Tessellations.

[BibT_eX]

[DOI]

Stephen J. Graves

Mark E. Watkins

SIAM J. Discret. Math., 2008

Multiple Kronecker covering graphs.

[BibT_eX]

[DOI]

Wilfried Imrich

Eur. J. Comb., 2008

The easy part?

[BibT_eX]

[DOI]

Ars Math. Contemp., 2008

What is Ars Mathematica Contemporanea?

[BibT_eX]

[DOI]

Ars Math. Contemp., 2008

2007

Semisymmetric graphs from polytopes.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2007

Oriented matroids and complete-graph embeddings on surfaces.

[BibT_eX]

[DOI]

Jürgen Bokowski

J. Comb. Theory A, 2007

Growth in Catacondensed Benzenoid Graphs.

[BibT_eX]

[DOI]

Primoz Luksic

J. Chem. Inf. Model., 2007

A classification of cubic bicirculants.

[BibT_eX]

[DOI]

Discret. Math., 2007

Heuristic search for Hamilton cycles in cubic graphs.

[BibT_eX]

[DOI]

Janez Ales

Bojan Mohar

Discret. Math., 2007

2006

Characterization of Complex Biological Systems by Matrix Invariants.

[BibT_eX]

[DOI]

Gasper Jaklic

J. Comput. Biol., 2006

Small Triangle-Free Configurations of Points and Lines.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2006

Erratum to "Reduction of symmetric configurations n3" [Discrete Appl. Math. 99 (1-3) (2000) 401 -411]

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

2005

The edge-transitive but not vertex-transitive cubic graph on 112 vertices.

[BibT_eX]

[DOI]

J. Graph Theory, 2005

The genus of the GRAY graph is 7.

[BibT_eX]

[DOI]

Steve Wilson

Eur. J. Comb., 2005

2004

Algorithms for Drawing Polyhedra from 3-Connected Planar Graphs.

[BibT_eX]

Informatica (Slovenia), 2004

Straight-ahead walks in Eulerian graphs.

[BibT_eX]

[DOI]

Discret. Math., 2004

The 10-cages and derived configurations.

[BibT_eX]

[DOI]

Discret. Math., 2004

On the orientable genus of the cartesian product of a complete regular tripartite graph with an even cycle.

[BibT_eX]

C. Paul Bonnington

Ars Comb., 2004

2003

Polycyclic configurations.

[BibT_eX]

[DOI]

Marko Boben

Eur. J. Comb., 2003

Preface.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2003

Topological Graph Theory.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Graph Theory., 2003

2002

Strongly adjacency-transitive graphs and uniquely shift-transitive graphs.

[BibT_eX]

[DOI]

Boris Zgrablic

Discret. Math., 2002

Cyclic Haar graphs.

[BibT_eX]

[DOI]

Milan Hladnik

Discret. Math., 2002

Growth in products of graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2002

2001

An algorithm for K-convex closure and an application.

[BibT_eX]

[DOI]

Blaz Zmazek

Int. J. Comput. Math., 2001

Interactive Conjecturing with Vega.

[BibT_eX]

[DOI]

Marko Boben

Proceedings of the Graphs and Discovery, 2001

2000

The Gray graph revisited.

[BibT_eX]

[DOI]

J. Graph Theory, 2000

Characterizing Graph Drawing with Eigenvectors.

[BibT_eX]

[DOI]

J. Chem. Inf. Comput. Sci., 2000

On Numerical Characterization of Cyclicity.

[BibT_eX]

[DOI]

Dejan Plavsic

J. Chem. Inf. Comput. Sci., 2000

Counting Symmetric Configurations v3.

[BibT_eX]

[DOI]

Anton Betten

Gunnar Brinkmann

Discret. Appl. Math., 2000

1999

Weakly Flag-transitive Configurations and Half-arc-transitive Graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1999

1998

Another Infinite Sequence of Dense Triangle-Free Graphs.

[BibT_eX]

[DOI]

Stephan Brandt

Electron. J. Comb., 1998

A generalized ring spiral algorithm for coding fullerenes and other cubic polyhedra.

[BibT_eX]

[DOI]

Proceedings of the Discrete Mathematical Chemistry, 1998

Foldedness in linear polymers: A difference between graphical and Euclidean distances.

[BibT_eX]

[DOI]

Proceedings of the Discrete Mathematical Chemistry, 1998

1997

Isoperimetric Quotient for Fullerenes and Other Polyhedral Cages.

[BibT_eX]

[DOI]

J. Chem. Inf. Comput. Sci., 1997

Recognizing Cartesian graph bundles.

[BibT_eX]

[DOI]

Wilfried Imrich

Discret. Math., 1997

1996

Generating Fullerenes at Random.

[BibT_eX]

[DOI]

Bor Plestenjak

Ante Graovac

J. Chem. Inf. Comput. Sci., 1996

1994

Homeomorphism of 2-Complexes is Graph Isomorphism Complete.

[BibT_eX]

[DOI]

SIAM J. Comput., 1994

Rotagraphs and Their Generalizations.

[BibT_eX]

[DOI]

J. Chem. Inf. Comput. Sci., 1994

Weights on Edges of Chemical Graphs Determined by Paths.

[BibT_eX]

[DOI]

J. Chem. Inf. Comput. Sci., 1994

On the genus of the tensor product of graphs where one factor is a regular graph.

[BibT_eX]

[DOI]

Tamara Dakic

Discret. Math., 1994

Preface.

[BibT_eX]

[DOI]

Discret. Math., 1994

Molecular Graph Eigenvectors for Molecular Coordinates.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

1993

Computing the Diameter in Multiple-Loop Networks.

[BibT_eX]

[DOI]

J. Algorithms, 1993

1992

Orientable quadrilateral embeddings of products of graphs.

[BibT_eX]

[DOI]

Discret. Math., 1992

The non-orientable genus of some metacyclic groups.

[BibT_eX]

[DOI]

Dave Witte

Comb., 1992

1990

Embeddings of cartesian products of nearly bipartite graphs.

[BibT_eX]

[DOI]

Bojan Mohar

Arthur T. White

J. Graph Theory, 1990

An algorithm for tree-realizability of distance matrices.

[BibT_eX]

[DOI]

Vladimir Batagelj

J. M. S. Simões-Pereira

Int. J. Comput. Math., 1990

1989

The Genus of the Product of a Group with an Abelian Group.

[BibT_eX]

[DOI]

Eur. J. Comb., 1989

The genus of low rank hamiltonian groups.

[BibT_eX]

[DOI]

Discret. Math., 1989

Universal commutator graphs.

[BibT_eX]

[DOI]

Discret. Math., 1989

Vector representations of graphs.

[BibT_eX]

[DOI]

Discret. Math., 1989

1988

Exotic n-universal graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1988

Nonorientable Embeddings of Groups.

[BibT_eX]

[DOI]

Arthur T. White

Eur. J. Comb., 1988

The Maximum Genus of Graph Bundles.

[BibT_eX]

[DOI]

Bojan Mohar

Martin Skoviera

Eur. J. Comb., 1988

1986

The matching polynomial of a polygraph.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1986

1985

The cartesian product of three triangles can be embedded into a surface of genus 7.

[BibT_eX]

[DOI]

Discret. Math., 1985

1983

Edge-colorability of graph bundles.

[BibT_eX]

[DOI]

Joze Vrabec

J. Comb. Theory B, 1983

1982

Nonorientable genus of cartesian products of regular graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1982

Hamiltonian cycles in the cartesian product of a tree and a cycle.

[BibT_eX]

[DOI]

Vladimir Batagelj

Discret. Math., 1982

1981

A duality theorem for graph embeddings.

[BibT_eX]

[DOI]

Brad Jackson

J. Graph Theory, 1981

Search for minimal trivalent cycle permutation graphs with girth nine.

[BibT_eX]

[DOI]

Discret. Math., 1981

1980

Genus of cartesian products of regular bipartite graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1980

Dual imbeddings and wrapped quasi-coverings of graphs.

[BibT_eX]

[DOI]