• Corpus ID: 239016965

Planar Median Graphs and Cubesquare-Graphs

  title={Planar Median Graphs and Cubesquare-Graphs},
  author={Carsten R. Seemann and Vincent Moulton and Peter F. Stadler and Marc Hellmuth},
Median graphs are connected graphs in which for all three vertices there is a unique vertex that belongs to shortest paths between each pair of these three vertices. In this paper we provide several novel characterizations of planar median graphs. More specifically, we characterize when a planar graph G is a median graph in terms of forbidden subgraphs and the structure of isometric cycles in G, and also in terms of subgraphs of G that are contained inside and outside of 4-cycles with respect… 

Figures from this paper


Medians in median graphs
The aim of this paper is to investigate the mutual relationship of the metric and the ordinal/ combinatorial approaches to the median problem in the class of median graphs and establish (i) and (ii) for arbitrary median graphs.
Metric graph theory and geometry: a survey
The article surveys structural characterizations of several graph classes defined by distance properties, which have in part a general algebraic flavor and can be interpreted as subdirect
Median Graphs and Triangle-Free Graphs
It is demonstrated that, intuitively speaking, there are as many median graphs as there are triangle-free graphs and the complexity of recognizing planar median graphs is linear.
Graphs of Some CAT(0) Complexes
  • V. Chepoi
  • Mathematics, Computer Science
    Adv. Appl. Math.
  • 2000
The graphs of some piecewise Euclidean simplicial and cubical complexes having nonpositive curvature in the sense of Gromov's CAT(0) inequality are characterized and it is shown that the graphs of all these complexes and some more general classes of graphs have geodesic combings and bicombings verifying the 1- or 2-fellow traveler property.
The structure of median graphs
It is proved that a median graph can be obtained from a one-vertex graph by an expansion procedure, and from this characterization some nice properties are derived.
Combinatorics and Geometry of Finite and Infinite Squaregraphs
It is shown that minimum-size median-generating sets of finite squaregraphs can be computed in polynomial time, whereas, not unexpectedly, the corresponding problem for median graphs turns out to be NP-hard.
Pseudo-median graphs: decomposition via amalgamation and Cartesian multiplication
It is shown that every finite pseudo-median graph can be built up by successive amalgamations of smaller pieces, including complete graphs minus matchings.
A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees
A simple linear algorithm for embedding (or drawing) a planar graph in the plane based on the “vertex-addition” algorithm of Lempel, Even, and Cederbaum that can find all the embeddings of aPlanar graph.
Distance Labeling Schemes for Cube-Free Median Graphs
The class of cube-free median graphs on $n$ nodes enjoys distance and routing labeling schemes with labels of $O(\log^3 n)$ bits.
A charaterization of planar median graphs
  • Iztok Peterin
  • Computer Science, Mathematics
    Discuss. Math. Graph Theory
  • 2006
Here an additional condition is introduced for the convex expansion procedure that characterizes planar median graphs, which has no characterization in the literature.