Related papers: Two Colored Diagrams for Central Configurations of…
We study the interplay between embedding constrained planarity and hybrid planarity testing. We consider a constrained planarity testing problem, called 1-Fixed Constrained Planarity, and prove that this problem can be solved in quadratic…
In this article, we discuss formal invariants of singularly-perturbed linear differential systems in neighborhood of turning points and give algorithms which allow their computation. The algorithms proposed are implemented in the computer…
In this paper we study the complexity of the following problems: Given a colored graph X=(V,E,c), compute a minimum cardinality set S of vertices such that no nontrivial automorphism of X fixes all vertices in S. A closely related problem…
In type-II superconductors, the dynamics of superconducting vortices determine their transport properties. In the Ginzburg-Landau theory, vortices correspond to topological defects in the complex order parameter. Extracting their precise…
Many variations of the classical graph coloring model have been intensively studied due to their multiple applications; scheduling problems and aircraft assignments, for instance, motivate the robust coloring problem. This model gets to…
The goal of this numerical study is to get insight into singular solutions of the two-dimensional (2D) Euler equations for non-smooth initial data, in particular for vortex sheets. To this end high resolution computations of vortex layers…
Given a static vertex-selection problem (e.g. independent set, dominating set) on a graph, we can define a corresponding temporally satisfying reconfiguration problem on a temporal graph which asks for a sequence of solutions to the…
We present a numerical study of the self-similar solutions of the Localized Induction Approximation of a vortex filament. These self-similar solutions, which constitute a one-parameter family, develop a singularity at finite time. We study…
We construct a sequence that converges to a solution of the Cauchy problem for a singularly perturbed linear inhomogeneous differential equation of an arbitrary order. This sequence is also an asymptotic sequence in the following sense: the…
We discuss the solution of regular and singular Sturm-Liouville problems by means of High Order Finite Difference Schemes. We describe a code to define a discrete problem and its numerical solution by means of linear algebra techniques.…
In this paper, we introduce the notion of 2-boundary planar graphs. A graph is 2-boundary planar if it has an embedding in the plane so that all vertices lie on the boundary of at most two faces and no edges are crossed. A proper coloring…
We present here random distributions on $(D+1)$-edge-colored, bipartite graphs with a fixed number of vertices $2p$. These graphs are dual to $D$-dimensional orientable colored complexes. We investigate the behavior of quantities related to…
The coloring problem is studied in the paper for graph classes defined by two small forbidden induced subgraphs. We prove some sufficient conditions for effective solvability of the problem in such classes. As their corollary we determine…
We consider the single-conflict coloring problem, a graph coloring problem in which each edge of a graph receives a forbidden ordered color pair. The task is to find a vertex coloring such that no two adjacent vertices receive a pair of…
A symmetric characteristic singular integral equation with two fixed singularities at the endpoints in the class of functions bounded at the ends is analyzed. It reduces to a vector Hilbert problem for a half-disc and then to a vector…
We address two questions related to the procedure of identifying center vortices based on center projection in maximal center gauge: 1. How does the procedure work, why is it expected to locate center vortices relevant for confinement, and…
In this paper, we study unique colourings in random graphs as a generalization of both conflict-free and injective colourings. Specifically, we impose the condition that a fraction of vertices in the neighbourhood of any vertex are assigned…
In the problem of 2-coloring without monochromatic triangles (or triangle-tree 2-coloring), vertices of the simple, connected, undirected graph are colored with either 'black' or 'white' such that there are no 3 mutually adjacent vertices…
Given a finite sequence of graphs, e.g., coming from technological, biological, and social networks, the paper proposes a methodology to identify possible changes in stationarity in the stochastic process generating the graphs. In order to…
In this study, we are concerned with spectral problems of second-order vector dynamic equations with two-point boundary value conditions and mixed derivatives, where the matrix-valued coefficient of the leading term may be singular, and the…