Intersection graphs of maximal hypercubes
From MaRDI portal
Publication:1867285
DOI10.1016/S0195-6698(02)00142-7zbMath1018.05091OpenAlexW2008957319MaRDI QIDQ1867285
Publication date: 2 April 2003
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0195-6698(02)00142-7
hypercubeexpansionintersection graphsimplicial complexmedian graphdually chordal graphacyclic cubical complex
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Isometric embedding in products of complete graphs
- Clique graphs and Helly graphs
- Superextensions and the depth of median graphs
- The structure of median graphs
- A convexity lemma and expansion procedures for bipartite graphs
- Graphs of acyclic cubical complexes
- A characterization of clique graphs
- Distance-preserving subgraphs of hypercubes
- n‐cubes and median graphs
- Dually Chordal Graphs
- Topics in Intersection Graph Theory
- Graph Classes: A Survey
- Clique Graphs of Chordal and Path Graphs
- Isometric subgraphs of Hamming graphs and d-convexity
- Doubly chordal graphs, steiner trees, and connected domination
- Partial Hamming graphs and expansion procedures
This page was built for publication: Intersection graphs of maximal hypercubes