Skip to main content
SpringerLink
Log in

Finding EPS-graphs

  • Published:
Monatshefte für Mathematik Aims and scope Submit manuscript

Abstract

An efficient algorithm is presented for finding an EPS-graph in a connected bridgeless graph.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Reference

  1. Fleischner, H.: On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs. J. Comb. Th. (B)16, 17–28 (1974).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Vanderbilt University, Station B, Box 77, 37235, Nashville, TN, USA

    H. T. Lau

Authors
  1. H. T. Lau
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

With 1 Figure

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lau, H.T. Finding EPS-graphs. Monatshefte für Mathematik 92, 37–40 (1981). https://doi.org/10.1007/BF01564847

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01564847

Keywords

Search

Navigation