New facets for the planar subgraph polytope

DOI10.1002/NET.20207MaRDI QIDQ5449667zbMATH OpenOpenAlexFDO

Authors Illya V. Hicks

Publication date 12 March 2008

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20207

zbMATH Keywords

planar graphplanar subgraph polytopepolyhedral combinatorics

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph representations (geometric and intersection representations, etc.) (05C62) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Maximum planar subgraphs and nice embeddings: Practical layout tools
• On the Steiner 2-edge connected subgraph polytope
• scientific article; zbMATH DE number 3929064
• Some new classes of facets for the equicut polytope
• Polyhedral study of the connected subgraph problem

This page was built for publication: New facets for the planar subgraph polytope

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