AbstractA distance-colouring relative to distance p of a graph G=(V,E) is a mapping of V in a set of colours in such a way that any two vertices of G of distance not greater than p have distinct colours. The purpose of this paper is to give a survey of the results related to the distance-colouring of graphs introduced in 1969
AbstractThe problem of colouring the real line so that the distance between like coloured numbers do...
International audienceFor a given bounded nonnegative integer ℓ, an ℓ-distance-edge-coloring of a gr...
International audienceFor an integer q ⩾ 2 and an even integer d, consider the graph obtained from a...
For a graph G with n vertices, average distance µ(G) is the ratio of sum of the lengths of the short...
Given a graph G = (V,E), a (d,k)-coloring is a function from the vertices V to colors {1, 2, ...,k} ...
Suppose D is a subset of all positive integers Z. The distance graph G(Z; D) is the graph with verte...
Dans cette thèse, on s’intéresse en particulier à la coloration du carré des graphes planaires (deux...
Abstract. Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1...
The primary aim of this paper is to publicize various problems regarding chromatic coloring of finit...
International audienceThe \ell-distance-edge-coloring is a generalization of the edge-coloring that ...
We consider two graph colouring problems in which edges at distance at most t are given distinct col...
AbstractWe study colourings of graphs with the property that the number of used colours cannot be re...
In this paper we introduce the notion of Σ-colouring of a graph G: For given subsets Σ(v) of neighbo...
AbstractLet G be an r-chromatic graph with an s-colorable subgraph, each of whose components is s-co...
AbstractSuppose D is a subset of all positive integers L. The distance graph G(L,D) is the graph wit...
AbstractThe problem of colouring the real line so that the distance between like coloured numbers do...
International audienceFor a given bounded nonnegative integer ℓ, an ℓ-distance-edge-coloring of a gr...
International audienceFor an integer q ⩾ 2 and an even integer d, consider the graph obtained from a...
For a graph G with n vertices, average distance µ(G) is the ratio of sum of the lengths of the short...
Given a graph G = (V,E), a (d,k)-coloring is a function from the vertices V to colors {1, 2, ...,k} ...
Suppose D is a subset of all positive integers Z. The distance graph G(Z; D) is the graph with verte...
Dans cette thèse, on s’intéresse en particulier à la coloration du carré des graphes planaires (deux...
Abstract. Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1...
The primary aim of this paper is to publicize various problems regarding chromatic coloring of finit...
International audienceThe \ell-distance-edge-coloring is a generalization of the edge-coloring that ...
We consider two graph colouring problems in which edges at distance at most t are given distinct col...
AbstractWe study colourings of graphs with the property that the number of used colours cannot be re...
In this paper we introduce the notion of Σ-colouring of a graph G: For given subsets Σ(v) of neighbo...
AbstractLet G be an r-chromatic graph with an s-colorable subgraph, each of whose components is s-co...
AbstractSuppose D is a subset of all positive integers L. The distance graph G(L,D) is the graph wit...
AbstractThe problem of colouring the real line so that the distance between like coloured numbers do...
International audienceFor a given bounded nonnegative integer ℓ, an ℓ-distance-edge-coloring of a gr...
International audienceFor an integer q ⩾ 2 and an even integer d, consider the graph obtained from a...
DOI
Add to ORKG