Computational complexity of covering cyclic graphs

DOI10.1016/S0012-365X(00)00262-4zbMATH Open0977.68045OpenAlexW2046768654WikidataQ127719305 ScholiaQ127719305MaRDI QIDQ5937921

Jiří Fiala

Publication date: 17 January 2002

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00262-4

Mathematics Subject Classification ID

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

Related Items (3)

Computing cyclomatic complexity with cubic flowgraphs ⋮ Title not available (Why is that?) ⋮ Algorithmic complexity of finding cross-cycles in flag complexes

Recommendations

• Computational complexity of covering disconnected multigraphs 👍 👎
• Covering Graphs by Cycles 👍 👎
• On the Complexity of Finding a Minimum Cycle Cover of a Graph 👍 👎
• Covering a graph with cycles 👍 👎
• The Parameterized Complexity of Graph Cyclability 👍 👎
• Complexity of graph covering problems 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Computational complexity of covering cyclic graphs

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