Netlike partial cubes, V: completion and netlike classes

DOI10.1016/j.disc.2009.01.019zbMath1209.05202OpenAlexW1972683033MaRDI QIDQ1043960

Norbert Polat

Publication date: 10 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.01.019

zbMATH Keywords

hypercubecompletiongeodesic convexitypartial cubemedian graphgated setnetlike partial cubecellular bipartite graphmedian cycle propertynetlike class

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Related Items (3)

Convex excess in partial cubes ⋮ Computing distance moments on graphs with transitive Djoković-Winkler relation ⋮ Wiener index in weighted graphs via unification of \(\varTheta^\ast\)-classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Isometric embedding in products of complete graphs
• Partial cubes and their \(\tau\)-graphs
• Gated sets in metric spaces
• Netlike partial cubes, IV: Fixed finite subgraph theorems
• Netlike partial cubes II. Retracts and netlike subgraphs
• Netlike partial cubes III. The median cycle property
• Superextensions and the depth of median graphs
• A canonical decomposition theory for metrics on a finite set
• The structure of median graphs
• A convexity lemma and expansion procedures for bipartite graphs
• Separation of two convex sets in convexity structures
• The median procedure on median graphs
• The lattice dimension of a graph
• Cellular bipartite graphs
• Netlike partial cubes. I. General properties
• Distance-preserving subgraphs of hypercubes
• Partial Cubes and Crossing Graphs
• Isometric subgraphs of Hamming graphs and d-convexity
• On compact median graphs
• On Tetha-graphs of partial cubes

This page was built for publication: Netlike partial cubes, V: completion and netlike classes