Netlike partial cubes II. Retracts and netlike subgraphs

DOI10.1016/j.disc.2008.04.008zbMath1194.05028OpenAlexW1999322844MaRDI QIDQ1025452

Norbert Polat

Publication date: 19 June 2009

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

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

zbMATH Keywords

retractHom-retractnetlike partial cubenetlike subgraphprism-retractable graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Moore Graphs and Cycles Are Extremal Graphs for Convex Cycles, First-order logic axiomatization of metric graph theory, Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes. I: Topologies and the geodesic convexity, Weak geodesic topology and fixed finite subgraph theorems in infinite partial cubes. II: Fixed subgraph properties and infinite treelike partial cubes, Characterizing almost-median graphs. II., Netlike partial cubes. I. General properties, Hypercellular graphs: partial cubes without \(Q_3^-\) as partial cube minor, Netlike partial cubes, IV: Fixed finite subgraph theorems, Netlike partial cubes III. The median cycle property, Netlike partial cubes, V: completion and netlike classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Isometric embedding in products of complete graphs
• Netlike partial cubes, IV: Fixed finite subgraph theorems
• On the geodesic pre-hull number of a graph
• Netlike partial cubes. I. General properties
• Distance-preserving subgraphs of hypercubes
• Retracts of hypercubes
• On compact median graphs