Related papers: Partial duality for ribbon graphs
In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete…
This article emphasizes an extension of the study of metric and par- tition dimension to hypergraphs. We give a sharp lower bounds for the metric and partition dimension of hypergraphs in general and give exact values under specified…
We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]
The geometric dual of a cellularly embedded graph is a fundamental concept in graph theory and also appears in many other branches of mathematics. The partial dual is an essential generalization which can be obtained by forming the…
We give an excluded minor characterisation of the class of ribbon graphs that admit partial duals of Euler genus at most one.
Recently, Gross, Mansour and Tucker introduced the partial-twuality polynomials. In this paper, we find that when there are enough parallel edges, any multiple graph is a negative answer to the problem 8.7 in their paper [European J.…
The mutually enriching relationship between graphs and matroids has motivated discoveries in both fields. In this paper, we exploit the similar relationship between embedded graphs and delta-matroids. There are well-known connections…
Recently, Gross, Mansour and Tucker introduced the partial-dual genus polynomial of a ribbon graph as a generating function that enumerates the partial duals of the ribbon graph by genus. It is analogous to the extensively-studied…
We introduce a polynomial invariant of graphs on surfaces, $P_G$, generalizing the classical Tutte polynomial. Topological duality on surfaces gives rise to a natural duality result for $P_G$, analogous to the duality for the Tutte…
In this paper a new graph invariant based on the minimal hitting set problem is introduced. It is shown that it represents a tight lower bound for the doubly metric dimension of a graph. Exact values of new invariant for paths, stars,…
We develop an algebraic framework for ribbon graphs, revealing symmetry properties of (partial) twisted duality. The original ribbon group action of Ellis-Monaghan and Moffatt restricts self-duality, -petriality, or -triality to the…
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…
We give an analogue of the Tutte polynomial for hypermaps. This polynomial can be defined as either a sum over subhypermaps, or recursively through deletion-contraction reductions where the terminal forms consist of isolated vertices. Our…
We study expanding maps and shrinking maps of subvarieties of Grassmann varieties in arbitrary characteristic. The shrinking map was studied independently by Landsberg and Piontkowski in order to characterize Gauss images. To develop their…
Using the orbicell decomposition of the Deligne-Mumford compactification of the moduli space of Riemann surfaces studied previously, a chain complex based on semistable ribbon graphs is constructed which is an extension of Konsevich's graph…
The recently introduced problem of extending partial interval representations asks, for an interval graph with some intervals pre-drawn by the input, whether the partial representation can be extended to a representation of the entire…
The ribbon group action extends geometric duality and Petrie duality by defining two embedded graphs as twisted duals precisely when they lie within the same orbit under this group action. Twisted duality yields numerous novel properties of…
The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$…
In the present work we are going to give a formal exposition of the ribbon graphs topic based on notes of Labourie \cite{Lab}, since is difficult to find as such in the literature.
The problem of extending partial geometric graph representations such as plane graphs has received considerable attention in recent years. In particular, given a graph $G$, a connected subgraph $H$ of $G$ and a drawing $\mathcal{H}$ of $H$,…