相关论文: Fractional Zero Forcing via Three-color Forcing Ga…

The applications of graph coloring are diverse and many so lots of new types of coloring are being proposed and explored. Here we define a safe k-coloring, motivated by the application of coloring to secret sharing. Secret sharing is a way…

Probabilistic zero forcing is a coloring game played on a graph where the goal is to color every vertex blue starting with an initial blue vertex set. As long as the graph is connected, if at least one vertex is blue then eventually all of…

Despite progress in automated fact-checking, most systems require a significant amount of labeled training data, which is expensive. In this paper, we propose a novel zero-shot method, which instead of operating directly on the claim and…

This paper explores the application of a new algebraic method of color exchanges to the edge coloring of simple graphs. Vizing's theorem states that the edge coloring of a simple graph $G$ requires either $\Delta$ or $\Delta+1$ colors,…

We give a linear-time algorithm to decide 3-colorability (and find a 3-coloring, if it exists) of quadrangulations of a fixed surface. The algorithm also allows to prescribe the coloring for a bounded number of vertices.

The semi-random graph process is a single-player game that begins with an empty graph on $n$ vertices. In each round, a vertex $u$ is presented to the player independently and uniformly at random. The player then adaptively selects a vertex…

A zero forcing set is a set $S$ of vertices of a graph $G$, called forced vertices of $G$, which are able to force the entire graph by applying the following process iteratively: At any particular instance of time, if any forced vertex has…

The paper provides a coherent presentation of an operator scheme, which is used in an approach to inverse problems of mathematical physics (the boundary control method). The scheme is based on the triangular factorization of operators. It…

An $(a:b)$-coloring of a graph $G$ is a function $f$ which maps the vertices of $G$ into $b$-element subsets of some set of size $a$ in such a way that $f(u)$ is disjoint from $f(v)$ for every two adjacent vertices $u$ and $v$ in $G$. The…

We consider vertex colorings of graphs in which adjacent vertices have distinct colors. A graph is $s$-chromatic if it is colorable in $s$ colors and any coloring of it uses at least $s$ colors. The forcing chromatic number $F(G)$ of an…

Vertex leaky forcing was recently introduced as a new variation of zero forcing in order to show how vertex leaks can disrupt the zero forcing process in a graph. An edge leak is an edge that is not allowed to be forced across during the…

Recently, there have been found new relations between the zero forcing number and the minimum rank of a graph with the algebraic co-rank. We continue on this direction by giving a characterization of the graphs with real algebraic co-rank…

Zero forcing is a process on a graph $G = (V,E)$ in which a set of initially colored vertices,$B_0(G) \subset V(G)$, can color their neighbors according to the color change rule. The color change rule states that if a vertex $v$ can color a…

In this paper, we initiate the study of the inverse eigenvalue problem for probe graphs. A probe graph is a graph whose vertices are partitioned into probe vertices and non-probe vertices such that the non-probe vertices form an independent…

In many practical applications the underlying graph must be as equitable colored as possible. A coloring is called equitable if the number of vertices colored with each color differs by at most one, and the least number of colors for which…

We introduce the fractional version of oriented coloring and initiate its study. We prove some basic results and study the parameter for directed cycles and sparse planar graphs. In particular, we show that for every $\epsilon > 0$, there…

Chung, Graham and Wilson defined a set of graphs $\mathcal{H}$ to be forcing, if any sequence of graphs $\{G_n\}_{n \geq 0}$ with $|G_n| = n$ must be quasirandom, whenever $hom(H, G_n)= (p^{|E(H)|}+o(1))n^{|V(H)|}$ for every $H \in…

We define the anti-forcing number of a perfect matching $M$ of a graph $G$ as the minimal number of edges of $G$ whose deletion results in a subgraph with a unique perfect matching $M$, denoted by $af(G,M)$. The anti-forcing number of a…

We define a method for edge coloring signed graphs and what it means for such a coloring to be proper. Our method has many desirable properties: it specializes to the usual notion of edge coloring when the signed graph is all-negative, it…

Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very…