Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs

DOI10.1145/322154.322155MaRDI QIDQ3048268zbMATH OpenOpenAlexWikidataFDO

Authors

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

zbMATH Keywords

analysis of algorithmsHamiltonian cycleisomorphism problem for maximal outerplanar graphslinear algorithmsremoval of verticesstring-matching automaton

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)

Cited in

(13)

• Generalized Steiner problem in outerplanar networks
• On a unique tree representation for \(P_ 4\)-extendible graphs
• A linear-time algorithm for isomorphism of a subclass of chordal graphs
• Subclasses of \(k\)-trees: characterization and recognition
• Maxregularity and maximal outerplanar graphs
• Polynomial algorithms for open plane graph and subgraph isomorphisms
• Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs
• The Wiener index of maximal outerplane graphs
• MAXIMAL OUTERPLANE GRAPHS WITH TWO SIMPLICIAL VERTICES
• Algorithm on rainbow connection for maximal outerplanar graphs
• Uniquely colorable graphs up to automorphisms
• Sorting and ranking of self-delimiting numbers with applications to outerplanar graph isomorphism
• Sharp bounds for Zagreb indices of maximal outerplanar graphs

This page was built for publication: Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3048268)