AbstractWe study the representation number for some special sparse graphs. For graphs with a single edge and for complete binary trees we give an exact formula, and for hypercubes we improve the known lower bound. We also study the prime factorization of the representation number of graphs with one edge
Representations of graphs are a way of encoding the structure of a graph by using other discrete str...
AbstractA graph G was defined in [16] as P4-reducible, if no vertex in G belongs to more than one ch...
A graph is representable by a ring if its vertices can be labeled with distinct ring elements so the...
AbstractWe study the representation number for some special sparse graphs. For graphs with a single ...
AbstractA graph G is P4-sparse if no set of five vertices in G induces more than one chordless path ...
A graph G has a representation modulo n if there exists an injective map f: V (G) → {0, 1,..., n} su...
A graph is said to be representable modulo n if its vertices can be labelled with distinct integers ...
A graph G has a representation modulo n if there exists an injective map f : V (G) → {0, 1, . . . , ...
A graph is said to be representable modulo n if its vertices can be labelled with distinct integers ...
AbstractA graph G has a representation modulo r if there exists an injective map f:V(G)→{0,1,…,r−1} ...
The book deals with questions which arise from storing a graph in a computer. Different classes of g...
A graph has a representation modulo n if there exists an injective map f: {V (G)} → {0, 1,...,n − 1}...
AbstractA simple graph G is representable in a real vector space of dimension m, if there is an embe...
We give an efficient encoding and decoding scheme for computing a compact representation of a graph ...
AbstractA hypergraph G=(V,E) is (k,ℓ)-sparse if no subset V′⊂V spans more than k|V′|−ℓ hyperedges. W...
Representations of graphs are a way of encoding the structure of a graph by using other discrete str...
AbstractA graph G was defined in [16] as P4-reducible, if no vertex in G belongs to more than one ch...
A graph is representable by a ring if its vertices can be labeled with distinct ring elements so the...
AbstractWe study the representation number for some special sparse graphs. For graphs with a single ...
AbstractA graph G is P4-sparse if no set of five vertices in G induces more than one chordless path ...
A graph G has a representation modulo n if there exists an injective map f: V (G) → {0, 1,..., n} su...
A graph is said to be representable modulo n if its vertices can be labelled with distinct integers ...
A graph G has a representation modulo n if there exists an injective map f : V (G) → {0, 1, . . . , ...
A graph is said to be representable modulo n if its vertices can be labelled with distinct integers ...
AbstractA graph G has a representation modulo r if there exists an injective map f:V(G)→{0,1,…,r−1} ...
The book deals with questions which arise from storing a graph in a computer. Different classes of g...
A graph has a representation modulo n if there exists an injective map f: {V (G)} → {0, 1,...,n − 1}...
AbstractA simple graph G is representable in a real vector space of dimension m, if there is an embe...
We give an efficient encoding and decoding scheme for computing a compact representation of a graph ...
AbstractA hypergraph G=(V,E) is (k,ℓ)-sparse if no subset V′⊂V spans more than k|V′|−ℓ hyperedges. W...
Representations of graphs are a way of encoding the structure of a graph by using other discrete str...
AbstractA graph G was defined in [16] as P4-reducible, if no vertex in G belongs to more than one ch...
A graph is representable by a ring if its vertices can be labeled with distinct ring elements so the...
DOI
Add to ORKG