Related papers: A linear-time algorithm for the strong chromatic i…
The star chromatic index of a multigraph $G$, denoted by $\chi_{\mathrm{star}}'(G)$, is the minimum number of colors needed to properly color the edges of $G$ such that no path or cycle of length $4$ is bicolored. In this paper, we study…
Total variant of well known graph coloring game is considered. We determine exact values of total game chromatic number for some classes of graphs and show show the strategie for first player to win the game. We also show relation between…
3-list colouring is an NP-complete decision problem. It is hard even on planar bipartite graphs. We give a polynomial-time algorithm for solving 3-list colouring on permutation graphs.
We present algorithms to work with iterated Eisenstein integrals that have recently appeared in the computation of multi-loop Feynman integrals. These algorithms allow one to analytically continue these integrals to all regions of the…
Problems of existence, construction and estimation of parameters of interval colorings of complete k-partite graphs K_{n}^{k} are investigated.
We introduce a notion of color-criticality in the context of chromatic-choosability. We define a graph $G$ to be strong $k$-chromatic-choosable if $\chi(G) = k$ and every $(k-1)$-assignment for which $G$ is not list-colorable has the…
In this paper, we study the Cartesian product of signed graphs as defined by Germina, Hameed and Zaslavsky (2011). Here we focus on its algebraic properties and look at the chromatic number of some Cartesian products. One of our main…
The primary objective of graph pattern matching is to find all appearances of an input graph pattern query in a large data graph. Such appearances are called matches. In this paper, we are interested in finding matches of interaction…
This article presents a validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem. The proposed algorithm is an implicit reduction procedure that combines primal and dual linear…
Large Language Models (LLMs) face significant limitations when applied to large-scale graphs, struggling with context constraints and inflexible reasoning. We present GraphChain, a framework that enables LLMs to analyze complex graphs…
Halin's well-known grid theorem states that a graph $G$ with a thick end must contain a subdivision of the hexagonal half-grid. We obtain the following strengthening when $G$ is vertex-transitive and locally finite. Either $G$ is…
We consider a robust variant of Dirac-type problems in $k$-uniform hypergraphs. For instance, we prove that if $H$ is a $k$-uniform hypergraph with minimum codegree at least $(1/2 + \gamma )n$, $\gamma >0$, and $n$ is sufficiently large,…
In this paper, we present a short proof of Halin's grid theorem.
In this article, we show how to transform a colored de Bruijn graph (dBG) into a practical index for processing massive sets of sequencing reads. Similar to previous works, we encode an instance of a colored dBG of the set using BOSS and a…
For each integer $t\ge 5$, we give a polynomial-time algorithm to test whether a graph contains an induced cycle with length at least $t$ and odd.
This paper presents an algorithm that transforms color visual images, like photographs or paintings, into tactile graphics. In the algorithm, the edges of objects are detected and colors of the objects are estimated. Then, the edges and the…
Halin graphs constitute an interesting class of planar and polyhedral graphs. A generalized Halin graph is obtained by connecting all leaves of a planar embedding of a tree via a cycle. A Halin graph is a generalized Halin graph having no…
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, we study how to draw Halin-graphs, i.e., planar graphs that consist of a tree $T$ and a cycle among the leaves of that tree. Based on tree-drawing algorithms and the pathwidth $ pw(T) $, a well-known graph parameter, we find…
In this paper we find chromatic numbers of distance graphs $G(n,3,2)$ for infinitely many n. Also we improve upper bound for $\chi(G(n,r,s))$ in large part of cases.