Complexity of circuit intersection in graphs

DOI10.1016/0012-365X(93)E0194-9zbMath0837.68082OpenAlexW1999399967MaRDI QIDQ1894765

Aviezri S. Fraenkel, Martin Loebl

Publication date: 16 April 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)e0194-9

zbMATH Keywords

coding theorystrict bounded circuit intersection

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• The covering radius of the cycle code of a graph
• Matching theory
• Maximality of the cycle code of a graph
• Recent results and questions in combinatorial game complexities
• Conservative weightings and ear-decompositions of graphs
• Planar Formulae and Their Uses
• An index of a graph with applications to knot theory

This page was built for publication: Complexity of circuit intersection in graphs