Pages that link to "Item:Q1272768"
From MaRDI portal
The following pages link to A convexity lemma and expansion procedures for bipartite graphs (Q1272768):
Displaying 25 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)
- A characterization of planar partial cubes (Q998403) (← links)
- On the geodesic pre-hull number of a graph (Q1024319) (← links)
- Netlike partial cubes III. The median cycle property (Q1025465) (← links)
- Netlike partial cubes, V: completion and netlike classes (Q1043960) (← links)
- Recognizing graphs of acyclic cubical complexes (Q1302166) (← links)
- On the natural imprint function of a graph (Q1348742) (← links)
- Quasi-median graphs, their generalizations, and tree-like equalities (Q1399693) (← links)
- Fast recognition algorithms for classes of partial cubes (Q1408812) (← links)
- Intersection graphs of maximal hypercubes (Q1867285) (← links)
- Daisy cubes and distance cube polynomial (Q2311367) (← links)
- Tree-like partial Hamming graphs (Q2442273) (← links)
- Netlike partial cubes. I. General properties (Q2461199) (← links)
- Fast recognition of Fibonacci cubes (Q2461540) (← links)
- Fully gated graphs: Recognition and convex operations (Q2519832) (← links)
- Convex excess in partial cubes (Q2891047) (← links)
- Tiled partial cubes (Q4539873) (← links)
- Corners and simpliciality in oriented matroids and partial cubes (Q6171497) (← links)
- First-order logic axiomatization of metric graph theory (Q6196830) (← links)
- A relation between the cube polynomials of partial cubes and the clique polynomials of their crossing graphs (Q6565816) (← links)
- A characterization of regular partial cubes whose all convex cycles have the same lengths (Q6642506) (← links)
- The complement of the Djoković-Winkler relation (Q6658058) (← links)
