Computational complexity of covering cyclic graphs

DOI10.1016/S0012-365X(00)00262-4MaRDI QIDQ5937921zbMATH OpenOpenAlexWikidataFDO

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

Recommendations

• Complexity of graph covering problems
• scientific article; zbMATH DE number 1236360
• On the Complexity of Finding a Minimum Cycle Cover of a Graph
• Covering Graphs by Cycles
• scientific article; zbMATH DE number 2081019
• Computational complexity of covering disconnected multigraphs
• scientific article; zbMATH DE number 434907
• scientific article; zbMATH DE number 4061294
• Covering a graph with cycles

Cited in

(9)

• scientific article; zbMATH DE number 1236360 (Why is no real title available?)
• scientific article; zbMATH DE number 4080906 (Why is no real title available?)
• Computing cyclomatic complexity with cubic flowgraphs
• On the computational complexity of the patrol boat scheduling problem with complete coverage
• On the Complexity of Cycle Enumeration for Simple Graphs
• scientific article; zbMATH DE number 89406 (Why is no real title available?)
• Computational complexity of the police officer patrol problem on weighted digraphs
• Algorithmic complexity of finding cross-cycles in flag complexes
• scientific article; zbMATH DE number 91031 (Why is no real title available?)

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)