Consequences of an algorithm for bridged graphs
type: Item
instance of: scholarly article
title: Consequences of an algorithm for bridged graphs
zbMATH Open document ID: 1041.05072
author: Van Bang Le
author: Jerry Spinrad
published in: Discrete Mathematics
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 2083654
zbMATH Keywords: Bridged graphs
zbMATH Keywords: Cop-win graphs
MaRDI profile type: Publication
full work available at URL: j.disc.2002.05.001
OpenAlex ID: W2145152756
cites work: On bridged graphs and cop-win graphs
cites work: Bridged graphs are cop-win graphs: An algorithmic proof
cites work: Matrix multiplication via arithmetic progressions
cites work: Bridged graphs and geodesic convexity
cites work: On diameters and radii of bridged graphs
cites work: Convexity in Graphs and Hypergraphs
cites work: On local convexity in graphs
cites work: Q3328583
cites work: On the null-homotopy of bridged graphs
cites work: Conditions for invariance of set diameters under d-convexification in a graph
DOI: 10.1016/J.DISC.2002.05.001
description: scientific article; zbMATH DE number 2083654