On the vertex separation of maximal outerplanar graphs

zbMATH Open1179.05096MaRDI QIDQ3620384FDOQ3620384

Authors: Minko Markov 

Publication date: 14 April 2009

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

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

zbMATH Keywords

computational complexitymaximal outerplanar graphvertex separationlinear layoutalgorithmic graph theorylayout stretchabilty

Mathematics Subject Classification ID

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

Cited In (9)

• MAXIMAL OUTERPLANE GRAPHS WITH TWO SIMPLICIAL VERTICES
• Title not available (Why is that?)
• Topological indices of maximal outerplane graphs with two simplicial vertices
• Maximal outerplane graphs of extremal diameter
• Title not available (Why is that?)
• The total vertex separation number of a graph
• On the vertex separation of cactus graphs
• On the planar, outer planar, cut vertices and end-regular comaximal graph of lattices
• 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)