Related papers: Some Euler-type formulas for planar graphs
The Euler genus of a graph is a fundamental and well-studied parameter in graph theory and topology. Computing it has been shown to be NP-hard by [Thomassen '89 & '93], and it is known to be fixed-parameter tractable. However, the…
Euler's elastica is a classical model of flexible slender structures, relevant in many industrial applications. Static equilibrium equations can be derived via a variational principle. The accurate approximation of solutions of this problem…
In this paper we develop an algorithm for obtaining some new linear relations among the Lauricella $F_D$ functions. Relations we obtain, generalize those hinted in the work of B. C. Carlson. The coefficients of these relations are contained…
Graphs can have different properties that lead to several graph types and may allow for a varying representation of diverse information. In order to clarify the modeling power of graphs, we introduce a partial order on the most common graph…
Graphical models can represent a multivariate distribution in a convenient and accessible form as a graph. Causal models can be viewed as a special class of graphical models that not only represent the distribution of the observed system…
We give a diagrammatic summary of the connections between various theorems and conjectures about the vanishing of the Euler characteristic.
By using Laurent graph polynomials instead of the usual ones, i.e. by allowing negative powers of the variables, we simplify an existing method of determining the Alon-Tarsi numbers of planar graphs.
In this paper we present algorithms for computing the topology of planar and space rational curves defined by a parametrization. The algorithms given here work directly with the parametrization of the curve, and do not require to compute or…
Based on the main result presented in a recent paper, we derive Ambarzumian-type theorems for Schr\"odinger operators defined on quantum graphs. We recover existing results such as the classical theorem by Ambarzumian and establish some…
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm to exactly sample a random ET of the given generalized…
Euler systems are certain compatible families of cohomology classes, which play a key role in studying the arithmetic of Galois representations. We briefly survey the known Euler systems, and recall a standard conjecture of Perrin-Riou…
For every integer $g$, isomorphism of graphs of Euler genus at most $g$ can be decided in linear time. This improves previously known algorithms whose time complexity is $n^{O(g)}$ (shown in early 1980's), and in fact, this is the first…
The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order.…
In this paper, we present a constructive and proof-relevant development of graph theory, including the notion of maps, their faces, and maps of graphs embedded in the sphere, in homotopy type theory. This allows us to provide an elementary…
We stratify families of projective and very affine hypersurfaces according to their topological Euler characteristic. Our new algorithms compute all strata using algebro-geometric techniques. For very affine hypersurfaces, we investigate…
In this paper we study Eulerian extensions with edge constraints and use the probabilistic method to establish sufficient conditions for a given connected graph to be a subgraph of a Eulerian graph containing $m$ edges, for a given number…
A graph $X$ is said to be a pattern polynomial graph if its adjacency algebra is a coherent algebra. In this study we will find a necessary and sufficient condition for a graph to be a pattern polynomial graph. Some of the properties of the…
A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.
In this paper I survey the sources of inspiration for my own and co-authored work in trying to develop a general theory of graph polynomials. I concentrate on meta-theorems, i.e., theorem which depend only on the form infinite classes of…
We establish a version of the Beurling-Pollard theorem for operator synthesis and apply it to derive some results on linear operator equations and to prove a Beurling-Pollard type theorem for Varopoulos tensor algebras. Additionally we…