相关论文: A Note on $J$-Colouring of Jahangir Graphs
The family of Chithra graphs is a wide ranging family of graphs which includes any graph of size at least one. Chithra graphs serve as a graph theoretical model for genetic engineering techniques or for modelling natural mutation within…
The studies on $b$-chromatic number attracted much interest since its introduction. In this paper, we discuss the $b$-chromatic number of certain classes of graphs and digraphs. The notion of a new general family of graphs called the…
If G is a graph and H is a set of subgraphs of G, then an edge-coloring of G is called H-polychromatic if every graph from H gets all colors present in G on its edges. The H-polychromatic number of G, denoted poly_H(G), is the largest…
A fall $k$-coloring of a graph $G$ is a proper $k$-coloring of $G$ such that each vertex of $G$ sees all $k$ colors on its closed neighborhood. In this paper, we answer some questions of \cite{dun} about some relations between fall…
The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…
In this paper, a new type of colouring called Johan colouring is introduced. This colouring concept is motivated by the newly introduced invariant called the rainbow neighbourhood number of a graph. The study ponders on maximal colouring…
Following our previous works on $C^*$-graph algebras and the associated Cuntz-Krieger graph families, in this paper we will try to have a look at the colored version of these structures and to see what a $C^*$-colored graph algebra might…
The families of graphs defined by a certain type of system of equations over commutative rings have been studied and used since 1990s. This survey presents these families and their applications related to graphs, digraphs, and hypergraphs.…
We survey work on coloring, list coloring, and painting squares of graphs; in particular, we consider strong edge-coloring. We focus primarily on planar graphs and other sparse classes of graphs.
If $G$ is a graph and $\mathcal{H}$ is a set of subgraphs of $G$, we say that an edge-coloring of $G$ is $\mathcal{H}$-polychromatic if every graph from $\mathcal{H}$ gets all colors present in $G$ on its edges. The…
A fall coloring of a graph G is a proper coloring of G with k colors such that each vertex sees all k colors on its closed neighborhood. In this short note, we characterize all fall colorings of Kneser graphs of type KG(n,2).
A vertex $v$ of a given graph is said to be in a rainbow neighbourhood of $G$ if every colour class of $G$ consists of at least one vertex from the closed neighbourhood $N[v]$. A maximal proper colouring of a graph $G$ is a Johan colouring…
A vertex $v$ of a given graph $G$ is said to be in a rainbow neighbourhood of $G$, with respect to a proper coloring $C$ of $G$, if the closed neighbourhood $N[v]$ of the vertex $v$ consists of at least one vertex from every colour class of…
Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of…
The road colouring theorem characterizes the class of strongly connected directed graphs with constant out-degree that admit a synchronizing road colouring. The subject of this paper is a pair of related conjectures that generalize the road…
In this paper, we introduce a class of graphs which we call average hereditary graphs. Many graphs that occur in the usual graph theory applications belong to this class of graphs. Many popular types of graphs fall under this class, such as…
We exhibit a 5-uniform hypergraph that has no polychromatic 3-coloring, but all its restricted subhypergraphs with edges of size at least 3 are 2-colorable. This disproves a bold conjecture of Keszegh and the author, and can be considered…
In this paper, we study Dehn colorings for spatial graphs, and give a family of spatial graph invariants that are called vertex-weight invariants. We give some examples of spatial graphs that can be distinguished by a vertex-weight…
We generalize the tree-confluent graphs to a broader class of graphs called Delta-confluent graphs. This class of graphs and distance-hereditary graphs, a well-known class of graphs, coincide. Some results about the visualization of…
We introduce the class of circular-arc H-graphs, which generalizes circular-arc graphs, particularly circular-arc bigraphs. We investigate two types of ordering-based characterizations of circular-arc r-graphs. Finally, we provide forbidden…