✦ LIBER ✦

A characterization of cube-hypergraphs

✍ Scribed by Gustav Burosch; Pier Vittorio Ceccherini

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 600 KB
Volume: 152
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00297-v

No coin nor oath required. For personal study only.

✦ Synopsis

We define the t-uniform cube-hypergraph of dimension n, Q(n, t), as the hypergraph which is the natural analogue of the n-dimensional hypercube Qn' and give a characterization of those t-uniform hypergraphs which are isomorphic to Q(n, t). This extends a previous result of S. Foldes in the graph case.

📜 SIMILAR VOLUMES

Isometric embeddings into cube-hypergrap

Isometric embeddings into cube-hypergraphs

✍ Gustav Burosch; Pier Vittorio Ceccherini 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 412 KB

We define the t-uniform cube-hypergraphs of dimension n, Q(n, t), and give two characterizations of those t-uniform hypergraphs isometrically embeddable into Q(t,n). This extends previous results of Djokovic (1973) and of Graham and Winkler (1984, 1985) for graphs.

A characterization of totally balanced h

A characterization of totally balanced hypergraphs

✍ Jenö Lehel 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 418 KB

A hypergraph is totally balanced if every non-trivial cycle has an edge containing at least three vertices of the cycle. Totally balanced hypergraphs are characterized here as special tree-hypergraphs. This approach provides a conceptually simpler proof of Anstee's related result and yields the stru

A Characterization of Graphs with No Cub

A Characterization of Graphs with No Cube Minor

✍ John Maharry 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 418 KB

In this paper it is shown that any 4-connected graph that does not contain a minor isomorphic to the cube is a minor of the line graph of V n for some n 6 or a minor of one of five graphs. Moreover, there exists a unique 5-connected graph on at least 8 vertices with no cube minor and a unique 4-conn

A characterization of the n-cube by conv

A characterization of the n-cube by convex subgraphs

✍ Patricia Vanden Cruyce 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 212 KB

subgraphs as the graph of the It-dimensional cube Q,, (n 2 3), then IV(r)1 b t V(Q,,)j. Moreover, if IV'(f)\ = I VI CI,,)~, f is isomorphic to Q,,.

A family of nonreconstructible hypergrap

A family of nonreconstructible hypergraphs

✍ W.L Kocay 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 894 KB

Interval hypergraphs and D-interval hype

Interval hypergraphs and D-interval hypergraphs

✍ John I. Moore Jr. 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 449 KB

A hypcrgraph H = ( ~,; g) is called an inler,, d hypergraph if there exists a one-try-one functio,~ [ mapping the elements of V h:~ points on the real line such that for each edge E, there is an interval !, containing the images of all elements of E, but not the images of any elements not in E,. The