Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs
From MaRDI portal
Publication:3048268
DOI10.1145/322154.322155zbMath0413.68058OpenAlexW2077331002WikidataQ129991984 ScholiaQ129991984MaRDI QIDQ3048268
No author found.
Publication date: 1979
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322154.322155
analysis of algorithmsHamiltonian cyclelinear algorithmsstring-matching automatonisomorphism problem for maximal outerplanar graphsremoval of vertices
Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)
Related Items
Unnamed Item ⋮ Polynomial algorithms for open plane graph and subgraph isomorphisms ⋮ Uniquely colorable graphs up to automorphisms ⋮ Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs ⋮ On a unique tree representation for \(P_ 4\)-extendible graphs ⋮ MAXIMAL OUTERPLANE GRAPHS WITH TWO SIMPLICIAL VERTICES ⋮ A linear-time algorithm for isomorphism of a subclass of chordal graphs ⋮ Algorithm on rainbow connection for maximal outerplanar graphs ⋮ Subclasses of \(k\)-trees: characterization and recognition ⋮ Sharp bounds for Zagreb indices of maximal outerplanar graphs ⋮ Unnamed Item ⋮ Generalized Steiner problem in outerplanar networks
