Finding EPS-graphs

DOI10.1007/BF01564847zbMath0456.05041MaRDI QIDQ1150378

H. T. 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

hamiltonian graphefficient algorithmspanning subgraphsquare of a graphconnected bridgeless graphEPS-graph

Mathematics Subject Classification ID

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

Related Items (5)

Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem ⋮ 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

This page was built for publication: Finding EPS-graphs