Pages that link to "Item:Q1408812"
From MaRDI portal
The following pages link to Fast recognition algorithms for classes of partial cubes (Q1408812):
Displaying 15 items.
- Characterizing almost-median graphs. II. (Q658076) (← links)
- Fast recognition of classes of almost-median graphs (Q864135) (← links)
- Characterizing almost-median graphs (Q872051) (← links)
- Partial cubes and their \(\tau\)-graphs (Q875040) (← links)
- Projection of a medium (Q924534) (← links)
- A characterization of planar partial cubes (Q998403) (← links)
- Recognizing graphs of acyclic cubical complexes (Q1302166) (← links)
- Recognizing halved cubes in a constant time per edge (Q1902967) (← links)
- On partial cubes, well-graded families and their duals with some applications in graphs (Q2192079) (← links)
- Hypercellular graphs: partial cubes without \(Q_3^-\) as partial cube minor (Q2297708) (← links)
- Computing median and antimedian sets in median graphs (Q2379917) (← links)
- Complexity of phylogenetic networks: Counting cubes in median graphs and related problems (Q2906543) (← links)
- Omega Polynomial in Nanostructures (Q2980009) (← links)
- Tiled partial cubes (Q4539873) (← links)
- Tree-like isometric subgraphs of hypercubes (Q4823305) (← links)
