Fast recognition of classes of almost-median graphs

DOI10.1016/j.disc.2006.07.011zbMath1109.05080OpenAlexW1990683373MaRDI QIDQ864135

Wilfried Imrich, Iztok Peterin, Alenka Lipovec, Petra Žigert Pleteršek

Publication date: 13 February 2007

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

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

zbMATH Keywords

algorithmouterplanar graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Characterizing almost-median graphs ⋮ Characterizing almost-median graphs. II.

Cites Work

• Isometric embedding in products of complete graphs
• A convexity lemma and expansion procedures for bipartite graphs
• Fast recognition algorithms for classes of partial cubes
• Resonance graphs of catacondensed even ring systems are median
• Distance-preserving subgraphs of hypercubes
• Arboricity and Subgraph Listing Algorithms
• Efficient Planarity Testing
• Quasi‐median graphs and algebras
• On Topological Invariants of the Product of Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast recognition of classes of almost-median graphs