scientific article; zbMATH DE number 165070
From MaRDI portal
Publication:4032985
Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
Cited in
(25)- Recognizing median graphs in subquadratic time
- Faster isometric embedding in products of complete graphs
- The direct expansion of graphs
- Clique-gated graphs
- The majority strategy on graphs
- Steiner intervals in graphs
- The median procedure on median graphs
- Fast recognition algorithms for classes of partial cubes
- Recognizing halved cubes in a constant time per edge
- Medians in median graphs and their cube complexes in linear time
- Linear recognition and embedding of Fibonacci cubes
- A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives
- Fast recognition of Fibonacci cubes
- On geodesic structures of weakly median graphs. II: Compactness, the role of isometric rays
- Fully gated graphs: Recognition and convex operations
- Planar median graphs and cubesquare-graphs
- Combinatorics and geometry of finite and infinite squaregraphs
- scientific article; zbMATH DE number 15874 (Why is no real title available?)
- scientific article; zbMATH DE number 845614 (Why is no real title available?)
- A charaterization of planar median graphs
- What do trees and hypercubes have in common?
- Recognizing pseudo-median graphs
- A poset-based approach to embedding median graphs in hypercubes and lattices
- From copair hypergraphs to median graphs with latent vertices
- Embedding graphs as isometric medians
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4032985)
