Related papers: Two Colored Diagrams for Central Configurations of…
In the Segment Intersection Graph Representation Problem, we want to represent the vertices of a graph as straight line segments in the plane such that two segments cross if and only if there is an edge between the corresponding vertices.…
We generalize a framework of list colouring results to correspondence colouring. Correspondence colouring is a generalization of list colouring wherein we localize the meaning of the colours available to each vertex. As pointed out by…
A singularly perturbed linear system of second order partial differential equations of parabolic reaction-diffusion type with given initial and boundary conditions is considered. The leading term of each equation is multiplied by a small…
The paper discusses a simple method of using the parametric continuation method to designate complex diagrams of steady states. The main advantage of the discussed approach is the fact that it does not require the installation of huge…
The structure and the degenracy of the ground state of a fully-frustrated XY-model are investigated for the case of a dice lattice geometry. The results are applicable for the description of Josephson junction arrays and thin…
Let $G = (V,E)$ be a finite simple graph. Recall that a proper coloring of $G$ is a mapping $\varphi: V\to\{1,\ldots,k\}$ such that every color class induces an independent set. Such a $\varphi$ is called a semi-matching coloring if the…
We investigate the relationship between two kinds of vertex colorings of graphs: unique-maximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ordered, and in every path of the graph the maximum color…
The authors study the spectral theory of self-adjoint operators that are subject to certain types of perturbations. An iterative introduction of infinitely many randomly coupled rank-one perturbations is one of our settings. Spectral…
In the Coloured Clustering problem, we wish to colour vertices of an edge coloured graph to produce as many stable edges as possible, i.e., edges with the same colour as their ends. In this paper, we reveal that the problem is in fact a…
The definition of $1$-planar graphs naturally extends graph planarity, namely a graph is $1$-planar if it can be drawn in the plane with at most one crossing per edge. Unfortunately, while testing graph planarity is solvable in linear time,…
A field theoretical method is developed which permits us to study the dynamics of vortices in disordered environments. In particular, we obtain a self-consistent system of equations for disorder averaged quantities. Making use of a…
The problem of vertex coloring in random graphs is studied using methods of statistical physics and probability. Our analytical results are compared to those obtained by exact enumeration and Monte-Carlo simulations. We critically discuss…
We study a class of infinite-dimensional singular stochastic control problems with applications in economic theory and finance. The control process linearly affects an abstract evolution equation on a suitable partially-ordered…
An equitable coloring of a graph $G=(V,E)$ is a (proper) vertex-coloring of $G$, such that the sizes of any two color classes differ by at most one. In this paper, we consider the equitable coloring problem in block graphs. Recall that the…
It is commonly accepted that the peak effect (PE) in the critical current density of type II superconductors is a consequence of an order-disorder transition in the vortex lattice (VL). Examination of vortex lattice configurations (VLCs) in…
Given a digraph with two terminal vertices $s$ and $t$ as well as a conservative cost function and several not necessarily disjoint color classes on its arc set, our goal is to find a minimum-cost subset of the arcs such that its…
In this paper, based on the contributions of Tucker (1983) and Seb{\H{o}} (1992), we generalize the concept of a sequential coloring of a graph to a framework in which the algorithm may use a coloring rule-base obtained from suitable…
Motivated by dynamic graph visualization, we study the problem of representing a graph $G$ in the form of a \emph{storyplan}, that is, a sequence of frames with the following properties. Each frame is a planar drawing of the subgraph of $G$…
We give an overview of invariants of algebraic singularities over perfect fields. We then show how they lead to a synthetic proof of embedded resolution of singularities of 2-dimensional schemes.
We study a new reconfiguration problem inspired by classic mechanical puzzles: a colored token is placed on each vertex of a given graph; we are also given a set of distinguished cycles on the graph. We are tasked with rearranging the…