✦ LIBER ✦

On the sphericity and cubicity of graphs

✍ Scribed by Peter C Fishburn

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 535 KB
Volume: 35
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(83)90057-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cubicity of interval graphs and the claw

Cubicity of interval graphs and the claw number

✍ Abhijin Adiga; L. Sunil Chandran 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 119 KB 👁 1 views

Let G(V , E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product I 1 ×I 2 ×• • •×I b , where each I i is a closed interval of unit length on the real line. The cubicity of G, denoted by cub(G), is the minimum positive in

On the sphericity of the graphs of semir

On the sphericity of the graphs of semiregular polyhedra

✍ Hiroshi Maehara 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 272 KB

The sphericity of a graph G is the smallest integer n such that G can be represented as the intersection graph of a family of unit-diameter spheres in Euclidean n-space E n. We determine here the sphericities of the graph of semiregular polyhedra in E 3 except a few prisms.

On the sphericity for the join of many g

On the sphericity for the join of many graphs

✍ Hiroshi Maehara 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 110 KB

It is proved that given any number of graphs of order at most n, the sphericity of their join does not exceed 2(n-1). We introduce an adjacency relation into Euclidean n-space E" so that it may be regarded as an infinite graph: Two points x and y of E" are defined to be adjacent if and only if 0<[x

On the linear k-arboricity of cubic grap

On the linear k-arboricity of cubic graphs

✍ Bill Jackson; Nicholas C. Wormald 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 231 KB

Bermond et al. [2] conjectured that the edge set of a cubic graph G can be partitioned into two k-linear forests, that is to say two forests whose connected components are paths of length at most k, for all k >/5. We shall prove a weaker result that the statement is valid for all k/> 18. All graphs

A note on the exceptional graph of the c

A note on the exceptional graph of the cubic lattice graph characterization

✍ Curtis R Cook 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 253 KB

On the Number of 3-Edge Colorings of Cub

On the Number of 3-Edge Colorings of Cubic Graphs

✍ Christian Szegedy 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 127 KB

In this paper we present a short algebraic proof for a generalization of a formula of R. Penrose, Some applications of negative dimensional tensors, in: Combinatorial Mathematics and its Applications Welsh (ed.), Academic Press, 1971, pp. 221-244 on the number of 3-edge colorings of a plane cubic gr