Opening book details…
Can I read A Convexity Lemma and Expansion Procedures for Bipartite Graphs on EtoBox?
A Convexity Lemma and Expansion Procedures for Bipartite Graphs by W. Imrich; S. Klavžar is a Mathematics article available to read on EtoBox.
What is A Convexity Lemma and Expansion Procedures for Bipartite Graphs about?
A hierarchy of classes of graphs is proposed which includes hypercubes, acyclic cubical complexes, median graphs, almost-median graphs, semi-median graphs and partial cubes. Structural properties of these classes are derived and used for the characterization of these classes by expansion procedures, for a characterization of semi-median graphs by metrically defined relations on the edge set of a graph and for a characterization of median graphs by forbidden subgraphs. Moreover, a convexity lemma is proved and used to derive a simple algorithm of complexity O(mn) for recognizing median graphs.
Who reads A Convexity Lemma and Expansion Procedures for Bipartite Graphs?
It is typically read by researchers, students, and practitioners in Mathematics.
- Author
- W. Imrich; S. Klavžar
- Publisher
- Elsevier Science; Elsevier ; Elsevier Inc.; Elsevier BV (ISSN 0195-6698)
- Published
- 1998
- Language
- EN
- Field
- Mathematics (Physical Sciences)