Detecting cycles through three fixed vertices in a graph

DOI10.1016/0020-0190(92)90128-IzbMath0764.68115OpenAlexW1993113968MaRDI QIDQ1198018

Herbert Fleischner, Gerhard J. Woeginger

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90128-i

zbMATH Keywords

cycledecompositionsgraph algorithmslinear time algorithmsubgraph homeomorphism problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Parameterized algorithms for list \(K\)-cycle ⋮ Walking through waypoints ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• The directed subgraph homeomorphism problem
• The subgraph homeomorphism problem
• Dividing a Graph into Triconnected Components
• The subgraph homeomorphism problem
• The Factorization of Linear Graphs
• The NP-completeness column: An ongoing guide

This page was built for publication: Detecting cycles through three fixed vertices in a graph