A hypercube \(Q_k\) is the graph with vertex set \(\{0,1\}^k\) where two vertices are adjacent whenever they differ in exactly one position. The cube graph \(Q(G)\) of a graph \(G\) is the intersection graph of maximal (induced) hypercubes of \(G\): The vertices of \(Q(G)\) correspond to the maximal hypercubes of \(G\), and two vertices are adjacent if the corresponding hypercubes are nondisjoint. The author investiges the cube graphs of several particular graph classes. Among other results, he proves that any graph is a cube graph of a bipartite graph, and that dually chordal graphs are exactly the cube graphs of graphs of acyclic cubical complexes.
- n‐cubes and median graphs
- A characterization of clique graphs
- A convexity lemma and expansion procedures for bipartite graphs
- Clique graphs and Helly graphs
- Clique Graphs of Chordal and Path Graphs
- Distance-preserving subgraphs of hypercubes
- Doubly chordal graphs, steiner trees, and connected domination
- Dually Chordal Graphs
- Graph Classes: A Survey
- Graphs of acyclic cubical complexes
- scientific article; zbMATH DE number 439012 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 15874 (Why is no real title available?)
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 1339499 (Why is no real title available?)
- scientific article; zbMATH DE number 1550912 (Why is no real title available?)
- Isometric embedding in products of complete graphs
- Isometric subgraphs of Hamming graphs and d-convexity
- Partial Hamming graphs and expansion procedures
- Superextensions and the depth of median graphs
- The structure of median graphs
- Topics in Intersection Graph Theory
- Cube intersection concepts in median graphs
- Generalized octahedra and cliques in intersection graphs of uniform hypergraphs
- Hypercubes, shuffle-exchange graphs and de Bruijn digraphs
- Homothetic polygons and beyond: maximal cliques in intersection graphs
- A characterization of cube-hypergraphs
- Θ-graphs of partial cubes and strong edge colorings
- scientific article; zbMATH DE number 125454 (Why is no real title available?)
- scientific article; zbMATH DE number 1161379 (Why is no real title available?)
- Two characterizations of hypercubes
- On the sphericity and cubicity of graphs
This page was built for publication: Intersection graphs of maximal hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1867285)
