Complexity of circuit intersection in graphs

DOI10.1016/0012-365X(93)E0194-9MaRDI QIDQ1894765zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On non-intersecting Eulerian circuits
• Hamiltonian circuits in interval graph generalizations
• On complexity of subset interconnection designs
• scientific article; zbMATH DE number 3985121
• scientific article; zbMATH DE number 4142090

Cites work

• An index of a graph with applications to knot theory
• Conservative weightings and ear-decompositions of graphs
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 475581 (Why is no real title available?)
• Matching theory
• Maximality of the cycle code of a graph
• Planar Formulae and Their Uses
• Recent results and questions in combinatorial game complexities
• The covering radius of the cycle code of a graph

Cited in

(2)

• Complexity of linear circuits and geometry
• scientific article; zbMATH DE number 4041955 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894765)