Finding EPS-graphs

DOI10.1007/BF01564847MaRDI QIDQ1150378zbMATH OpenFDO

Authors Hang Lau

Publication date 1981

Published in Monatshefte für Mathematik (Search for Journal in Brave)

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

zbMATH Keywords

spanning subgraphefficient algorithmsquare of a graphhamiltonian graphconnected bridgeless graphEPS-graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45) Connectivity (05C40)

Cited in

(5)

• Computing roots of graphs is hard
• Performance guarantees for the TSP with a parameterized triangle inequality
• Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs
• Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae
• Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem

This page was built for publication: Finding EPS-graphs

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