A convexity lemma and expansion procedures for bipartite graphs

DOI10.1006/eujc.1998.0229zbMath0918.05085DBLPjournals/ejc/ImrichK98OpenAlexW2063958901WikidataQ60962152 ScholiaQ60962152MaRDI QIDQ1272768

Sandi Klavžar, Wilfried Imrich

Publication date: 24 August 1999

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

Full work available at URL: https://semanticscholar.org/paper/5397243286b03ef035af20c25166d4c28f91d436

zbMATH Keywords

complexityalgorithmsbipartite graphsrecognitionmedian graphsHamming graphsconvexity lemmapartial cubesacyclic cubical complexesexpansion procedures

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (21)

Convex excess in partial cubes ⋮ Tiled partial cubes ⋮ On the natural imprint function of a graph ⋮ Fast recognition of classes of almost-median graphs ⋮ Characterizing almost-median graphs ⋮ Partial cubes and their \(\tau\)-graphs ⋮ Quasi-median graphs, their generalizations, and tree-like equalities ⋮ Corners and simpliciality in oriented matroids and partial cubes ⋮ First-order logic axiomatization of metric graph theory ⋮ Fast recognition algorithms for classes of partial cubes ⋮ Tree-like partial Hamming graphs ⋮ Characterizing almost-median graphs. II. ⋮ Netlike partial cubes. I. General properties ⋮ Fast recognition of Fibonacci cubes ⋮ A characterization of planar partial cubes ⋮ Fully gated graphs: Recognition and convex operations ⋮ On the geodesic pre-hull number of a graph ⋮ Netlike partial cubes III. The median cycle property ⋮ Daisy cubes and distance cube polynomial ⋮ Netlike partial cubes, V: completion and netlike classes ⋮ Intersection graphs of maximal hypercubes

This page was built for publication: A convexity lemma and expansion procedures for bipartite graphs