On the vertex separation of maximal outerplanar graphs

MaRDI QIDQ3620384zbMATH OpenFDO

Authors Minko Markov

Publication date 14 April 2009

Full work available at URL https://eudml.org/doc/11463

zbMATH Keywords

algorithmic graph theorycomputational complexitylayout stretchabiltylinear layoutmaximal outerplanar graphvertex separation

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• On the vertex separation of cactus graphs
• scientific article; zbMATH DE number 3875306
• scientific article; zbMATH DE number 3857141
• The vertex separator problem: a polyhedral investigation
• Partial domination of maximal outerplanar graphs

Cited in

(9)

• On the planar, outer planar, cut vertices and end-regular comaximal graph of lattices
• scientific article; zbMATH DE number 6096647 (Why is no real title available?)
• scientific article; zbMATH DE number 3878973 (Why is no real title available?)
• On the vertex separation of cactus graphs
• The total vertex separation number of a graph
• Maximal outerplane graphs of extremal diameter
• Topological indices of maximal outerplane graphs with two simplicial vertices
• MAXIMAL OUTERPLANE GRAPHS WITH TWO SIMPLICIAL VERTICES
• On the general position numbers of maximal outerplane graphs

This page was built for publication: On the vertex separation of maximal outerplanar graphs

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