Add to ORKGFor any hereditary graph class $\mathcal F$, we construct optimal adjacency labeling schemes for the classes of subgraphs and induced subgraphs of Cartesian products of graphs in $\mathcal F$. As a consequence, we show that, if $\mathcal F$ admits efficient adjacency labels (or, equivalently, small induced-universal graphs) meeting the information-theoretic minimum, then the classes of subgraphs and induced subgraphs of Cartesian products of graphs in $\mathcal F$ do too.Comment: 10 page
AbstractWe show the link between the existence of perfect Lee codes and minimum dominating sets of C...
In this paper we look at the problem of adjacency labeling of graphs. Given a family of undirected g...
In this article we establish relationships between Leavitt path algebras, talented monoids and the a...
For any hereditary graph class $\mathcal F$, we construct optimal adjacency labeling schemes for the...
16 pagesInternational audienceWe construct asymptotically optimal adjacency labelling schemes for ev...
35 pages; 8 figuresInternational audienceWe show that there exists an adjacency labelling scheme for...
We introduce the concept of adjacency labeling schemes and recent results in the area. These schemes...
Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to...
AbstractFor a graph G, let D(G) be the family of strong orientations of G. Define d⇀(G)=min{d(D)/D∈D...
AbstractFor a graph G, let D(G) be the family of strong orientations of G, and define d⇀(G)=min{d(D...
We investigate adjacency labeling schemes for graphs of bounded degree ∆ = O(1). In particular, we ...
The distinguishing number ▫$D(G)$▫ of a graph ▫$G$▫ is the least integer ▫$d$▫ such that there is a ...
If d(x, y) denotes the distance between vertices x and y in a graph G, then an L(2, 1)-labeling of a...
An adjacency labeling scheme labels the n nodes of a graph with bit strings in a way that allows, gi...
AbstractAn L(d,1)-labeling of a graph G is an assignment of nonnegative integers to the vertices suc...
AbstractWe show the link between the existence of perfect Lee codes and minimum dominating sets of C...
In this paper we look at the problem of adjacency labeling of graphs. Given a family of undirected g...
In this article we establish relationships between Leavitt path algebras, talented monoids and the a...
For any hereditary graph class $\mathcal F$, we construct optimal adjacency labeling schemes for the...
16 pagesInternational audienceWe construct asymptotically optimal adjacency labelling schemes for ev...
35 pages; 8 figuresInternational audienceWe show that there exists an adjacency labelling scheme for...
We introduce the concept of adjacency labeling schemes and recent results in the area. These schemes...
Cartesian products of graphs have been studied extensively since the 1960s. They make it possible to...
AbstractFor a graph G, let D(G) be the family of strong orientations of G. Define d⇀(G)=min{d(D)/D∈D...
AbstractFor a graph G, let D(G) be the family of strong orientations of G, and define d⇀(G)=min{d(D...
We investigate adjacency labeling schemes for graphs of bounded degree ∆ = O(1). In particular, we ...
The distinguishing number ▫$D(G)$▫ of a graph ▫$G$▫ is the least integer ▫$d$▫ such that there is a ...
If d(x, y) denotes the distance between vertices x and y in a graph G, then an L(2, 1)-labeling of a...
An adjacency labeling scheme labels the n nodes of a graph with bit strings in a way that allows, gi...
AbstractAn L(d,1)-labeling of a graph G is an assignment of nonnegative integers to the vertices suc...
AbstractWe show the link between the existence of perfect Lee codes and minimum dominating sets of C...
In this paper we look at the problem of adjacency labeling of graphs. Given a family of undirected g...
In this article we establish relationships between Leavitt path algebras, talented monoids and the a...