DOIAbstract
AbstractAigner et al., proved that for the irregular coloring number c(G) of a simple 2-regular graph of order n the inequality c(G) ⩽ √8n + O(1) holds. Here it is shown that c(G) ⩽ √2n + O(1)
AbstractAigner et al., proved that for the irregular coloring number c(G) of a simple 2-regular graph of order n the inequality c(G) ⩽ √8n + O(1) holds. Here it is shown that c(G) ⩽ √2n + O(1)
AbstractA 2-hued coloring of a graph G is a coloring such that, for every vertex v∈V(G) of degree at...
An irregular coloring of a graph is a proper vertex coloring that distinguishes vertices in the grap...
The number of colors, required to color properly the edges of a simple graph G in such a way that an...
AbstractAigner et al., proved that for the irregular coloring number c(G) of a simple 2-regular grap...
AbstractThe vertex-distinguishing index χs′(G) of a graph G is the minimum number of colours require...
AbstractAn edge-coloring of a graph G is called vertex-distinguishing if for any two distinct vertic...
In the PhD thesis by Burris (Memphis (1993)), a conjecture was made concerning the number of colors ...
AbstractAn irregular coloring of a graph is a proper vertex coloring that distinguishes vertices in ...
AbstractWe discuss the following conjecture: If G = (V, E) is a Δ-regular simple graph with an even ...
Abstract. An adjacent vertex distinguishing edge-coloring of a simple graph G is a proper edge-color...
The general vertex-distinguishing total chromatic number of a graph G is the minimum integer k, for ...
AbstractFix a 2-coloring Hk+1 of the edges of a complete graph Kk+1. Let C(n,Hk+1) denote the maximu...
In a paper by Burris and Schelp [3], a conjecture was made concerning the number of colors χ′s(G) re...
AbstractWe consider the following conjecture:Let G be a k-regular simple graph with an even number n...
An (r − 1, 1)-coloring of an r-regular graph G is an edge coloring (with arbitrarily many colors) su...
AbstractA 2-hued coloring of a graph G is a coloring such that, for every vertex v∈V(G) of degree at...
An irregular coloring of a graph is a proper vertex coloring that distinguishes vertices in the grap...
The number of colors, required to color properly the edges of a simple graph G in such a way that an...
AbstractAigner et al., proved that for the irregular coloring number c(G) of a simple 2-regular grap...
AbstractThe vertex-distinguishing index χs′(G) of a graph G is the minimum number of colours require...
AbstractAn edge-coloring of a graph G is called vertex-distinguishing if for any two distinct vertic...
In the PhD thesis by Burris (Memphis (1993)), a conjecture was made concerning the number of colors ...
AbstractAn irregular coloring of a graph is a proper vertex coloring that distinguishes vertices in ...
AbstractWe discuss the following conjecture: If G = (V, E) is a Δ-regular simple graph with an even ...
Abstract. An adjacent vertex distinguishing edge-coloring of a simple graph G is a proper edge-color...
The general vertex-distinguishing total chromatic number of a graph G is the minimum integer k, for ...
AbstractFix a 2-coloring Hk+1 of the edges of a complete graph Kk+1. Let C(n,Hk+1) denote the maximu...
In a paper by Burris and Schelp [3], a conjecture was made concerning the number of colors χ′s(G) re...
AbstractWe consider the following conjecture:Let G be a k-regular simple graph with an even number n...
An (r − 1, 1)-coloring of an r-regular graph G is an edge coloring (with arbitrarily many colors) su...
AbstractA 2-hued coloring of a graph G is a coloring such that, for every vertex v∈V(G) of degree at...
An irregular coloring of a graph is a proper vertex coloring that distinguishes vertices in the grap...
The number of colors, required to color properly the edges of a simple graph G in such a way that an...
Add to ORKG