\(N\)-separators in planar graphs

DOI10.1016/j.ejc.2011.09.003zbMath1230.05115OpenAlexW2024170811MaRDI QIDQ661948

S. A. Tishchenko

Publication date: 11 February 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2011.09.003

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Signed and weighted graphs (05C22)

Related Items (7)

On the maximum order of graphs embedded in surfaces ⋮ Edge separators for quasi-binary trees ⋮ Maximum size of a planar graph with given degree and diameter ⋮ The degree/diameter problem in maximal planar bipartite graphs ⋮ Maximum size of a planar graph with given degree and even diameter ⋮ The degree-diameter problem for sparse graph classes ⋮ The degree/diameter problem in maximal planar bipartite graphs

Cites Work

• Large planar graphs with given diameter and maximum degree
• A Separator Theorem for Planar Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(N\)-separators in planar graphs