Consequences of an algorithm for bridged graphs

Discrete Mathematics

Volumn 280, Issue 1-3, 2004, Pages 271-274

  Le, Van Bang ^a   Spinrad, Jerry ^b  

^a UNIVERSITY OF ROSTOCK   (Germany)

^b VANDERBILT UNIVERSITY   (United States)

Author keywords

Bridged graphs; Cop win graphs

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; MATRIX ALGEBRA; PROBLEM SOLVING;

BRIDGED GRAPHS; COP-WIN GRAPHS;

GRAPH THEORY;

EID: 1642387364     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2002.05.001     Document Type: Article

References (10)

1. Anstee R.P., Farber M. On bridged graphs and cop-win graphs. J. Combin. Theory (B). 44:1988;22-28.
2. Chepoi V. Bridged graphs are cop-win graphs: an algorithmic proof. J. Combin. Theory (B). 69:1997;97-100.
3. Coppersmith D., Winograd S. Matrix multiplication via arithmetic progressions. J. Symbolic Comput. 9:1990;1-6.
4. Farber M. Bridged graphs and geodesic convexity. Discrete Math. 66:1987;249-257.
5. Farber M. On diameters and radii of bridged graphs. Discrete Math. 73:1989;249-260.
6. Farber M., Jamison R.E. On local convexity in graphs. SIAM J. Algebraic Discrete Methods. 7:1986;433-444.
7. Farber M., Jamison R.E. Convexity in graphs and hypergraphs. Discrete Math. 66:1987;231-247.
8. Golumbic M.C. Algorithmic Graph Theory and Perfect Graphs. 1980;Academic Press, New York.
9. Jamison R.E. On the null-homotopy of bridged graphs. European J. Combin. 8:1987;421-428.
10. Soltan V., Chepoi V. Conditions for invariance of set diameters under. d -convexification in a graph Cybernetics. 19:1983;750-756.