12 citations · 15 across the 7 of their papers we have counts for
7 papers
A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth
Sergio Cabello, Alexander Dobler, Gašper Fijavž +2
A drawing of a graph is 1-planar if each edge participates in at most one crossing and adjacent edges do not cross. Up to symmetry, each crossing in a 1-planar drawing belongs to o…
Threshold Colorings of Prisms and the Petersen Graph
Gasper Fijavz, Matthias Kriesell
Let be a graph, integers, and . An -threshold-coloring of with respect to is a mapping such t…
On minimal graphs containing k perfect matchings
Gasper Fijavz, Matthias Kriesell
We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision o…
Strong Traces Model of Self-Assembly Polypeptide Structures
Gašper Fijavž, Tomaž Pisanski, Jernej Rus
A novel self-assembly strategy for polypeptide nanostructure design was presented in [Design of a single-chain polypeptide tetrahedron assembled from coiled-coil segments, Nature C…
Threshold-Coloring and Unit-Cube Contact Representation of Graphs
Md. Jawaherul Alam, Steven Chaplick, Gašper Fijavž +3
In this paper we study threshold coloring of graphs, where the vertex colors represented by integers are used to describe any spanning subgraph of the given graph as follows. Pairs…
Graph Minors and Minimum Degree
Gašper Fijavž, David R. Wood
Let be the class of graphs for which every minor has minimum degree at most . Then is closed under taking minors. By the Robertson-Seymour graph…