相关论文: Colouring quadrangulations of projective spaces

In this paper, we study orthogonal colourings of random geometric graphs. Two colourings of a graph are orthogonal if they have the property that when two vertices receive the same colour in one colouring, then those vertices receive…

A coloring of a graph $G=(V,E)$ is a partition $\{V_1, V_2, \ldots, V_k\}$ of $V$ into independent sets or color classes. A vertex $v\in V_i$ is a Grundy vertex if it is adjacent to at least one vertex in each color class $V_j$ for every…

A b-coloring of a graph $G$ is a coloring of its vertices such that every color class contains a vertex that has neighbors in all other classes. The b-chromatic number of $G$ is the largest integer $k$ such that $G$ has a b-coloring with…

We classify the countable homogeneous coloured multipartite graphs with any finite number of parts. By Fraisse's Theorem this amounts to classifying the families F of pairwise non-embeddable finite coloured multipartite graphs for which the…

Let $G$ be a quadrangulation on an orientable surface and let $g$ be a proper vertex-$4$-coloring of $G$. A face $F$ of $G$ is said to be a rainbow-face if all four distinct colors appear on its boundary. A $(c_1,c_2,c_3,c_4)$-face in $G$…

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 use the Schwarz-Christoffel formula to show that for every $n\geq 3$, the space of labelled immersed $n$-gons in the plane up to similarity is homeomorphic to $\mathbb{R}^{2n-4}$. We then prove that all immersed triangles,…

Grotzsch proved that every triangle-free planar graph is 3-colorable. Thomassen proved that every planar graph of girth at least five is 3-choosable. As for other surfaces, Thomassen proved that there are only finitely many 4-critical…

Let G be a plane graph with maximum face size D. If all faces of G with size four or more are vertex disjoint, then G has a cyclic coloring with D+1 colors, i.e., a coloring such that all vertices incident with the same face receive…

A \emph{majority coloring} of a digraph is a coloring of its vertices such that for each vertex $v$, at most half of the out-neighbors of $v$ has the same color as $v$. A digraph $D$ is \emph{majority $k$-choosable} if for any assignment of…

Three--dimensional colored triangulations are gluings of tetrahedra whose faces carry the colors 0, 1, 2, 3 and in which the attaching maps between tetrahedra are defined using the colors. This framework makes it possible to generalize the…

The chromatic polynomial $\pi_{G}(k)$ of a graph $G$ can be viewed as counting the number of vertices in a family of coloring graphs $\mathcal C_k(G)$ associated with (proper) $k$-colorings of $G$ as a function of the number of colors $k$.…

An injective $k$-edge-coloring of a graph $G$ is an assignment of colors, i.e. integers in $\{1, \ldots , k\}$, to the edges of $G$ such that any two edges each incident with one distinct endpoint of a third edge, receive distinct colors.…

A simple graph is triangular if every edge is contained in a triangle. A sequence of integers is graphical if it is the degree sequence of a simple graph. Egan and Nikolayevsky recently conjectured that every graphical sequence whose terms…

Planar bipartite graphs can be represented as touching graphs of horizontal and vertical segments in $\mathbb{R}^2$. We study a generalization in space: touching graphs of axis-aligned rectangles in $\mathbb{R}^3$, and prove that planar…

There exists a variety of coloring problems for plane graphs, involving vertices, edges, and faces in all possible combinations. For instance, in the \emph{entire coloring} of a plane graph we are to color these three sets so that any pair…

A quadrangular embedding of a graph in a surface $\Sigma$, also known as a quadrangulation of $\Sigma$, is a cellular embedding in which every face is bounded by a $4$-cycle. A quadrangulation of $\Sigma$ is minimal if there is no…

The clustering of a graph coloring is the maximum size of monochromatic components. This paper studies colorings with bounded clustering in graph classes with bounded layered treewidth, which include planar graphs, graphs of bounded Euler…

We extend classical notions of definable colourability of graphs to the general projective setting and investigate whether known results, mainly about the $G_0$ dichotomy and the $2n + 1$ conjecture, hold in the context of higher projective…

We give a (computer assisted) proof that the edges of every graph with maximum degree 3 and girth at least 17 may be 5-colored (possibly improperly) so that the complement of each color class is bipartite. Equivalently, every such graph…