Induced circuits in planar graphs

DOI10.1006/jctb.1994.1011zbMath0794.05121OpenAlexW2028803564MaRDI QIDQ1322013

V. Pereyra

Publication date: 5 May 1994

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: http://dare.uva.nl/personal/pure/en/publications/induced-circuits-in-planar-graphs(e971b42e-1bb8-4759-8bd5-cf55ca6b7c29).html

zbMATH Keywords

polynomial-time algorithmplanar graphellipsoid methoduniversal covering surfaceinduced circuit

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Chordless paths through three vertices ⋮ The complexity of induced minors and related problems ⋮ Non-interfering network flows ⋮ A linear time algorithm for the induced disjoint paths problem in planar graphs ⋮ Algorithms for finding an induced cycle in planar graphs ⋮ Induced Disjoint Paths in Claw-Free Graphs ⋮ Induced disjoint paths in AT-free graphs

This page was built for publication: Induced circuits in planar graphs