Graphs of acyclic cubical complexes

DOI10.1006/EUJC.1996.0010MaRDI QIDQ1911833zbMATH OpenOpenAlexFDO

Authors Hans-Jürgen Bandelt, Victor Chepoi

Publication date 1 October 1996

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/682186281ad7116bff4763e7487b04e90ef15f0c

zbMATH Keywords

hypergraphhull numbermedian graphperfect graphscubical complexMulder conjecturestar-contraction number

Mathematics Subject Classification ID

Paths and cycles (05C38) Hypergraphs (05C65) Structural characterization of families of graphs (05C75)

Recommendations

• Recognizing graphs of acyclic cubical complexes
• On cube-free median graphs
• The hypergraph of \(\Theta \)-classes and \(\Theta \)-graphs of partial cubes.
• Planar median graphs and cubesquare-graphs
• Characterizing almost-median graphs. II.

Cited in

(16)

• Fast recognition algorithms for classes of partial cubes
• Cube intersection concepts in median graphs
• Asymptotic properties of Fibonacci cubes and Lucas cubes
• Partial cubes and their \(\tau\)-graphs
• Maximal proper subgraphs of median graphs
• On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes
• The hypergraph of \(\Theta \)-classes and \(\Theta \)-graphs of partial cubes.
• Crossing graphs of fiber-complemented graphs
• scientific article; zbMATH DE number 3936535 (Why is no real title available?)
• Uprooted phylogenetic networks
• Crossing graphs of fiber-complemented graphs
• Induced cycles in crossing graphs of median graphs
• A multifacility location problem on median spaces
• Characterizing almost-median graphs. II.
• Intersection graphs of maximal hypercubes
• Moore graphs and cycles are extremal graphs for convex cycles

This page was built for publication: Graphs of acyclic cubical complexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1911833)