z-logo
open-access-imgOpen Access
Dividing a Graph into Triconnected Components
Author(s) -
John E. Hopcroft,
Robert E. Tarjan
Publication year - 1973
Publication title -
siam journal on computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.533
H-Index - 122
eISSN - 1095-7111
pISSN - 0097-5397
DOI - 10.1137/0202012
Subject(s) - graph , computer science , combinatorics , constant (computer programming) , mathematics , theoretical computer science , algorithm , programming language
summary:In this work, we get a combinatorial characterization for maximal generalized outerplanar graphs (mgo graphs). This result yields a recursive algorithm testing whether a graph is a mgo graph or not

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom