How to survive while visiting a graph

DOI10.1016/S0166-218X(99)00139-0zbMATH Open0940.05062OpenAlexW2071028712MaRDI QIDQ1962049FDOQ1962049

Authors Claudio Arbib, Enrico Nardelli, Michele Flammini

Publication date 13 July 2000

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

Full work available at URL https://doi.org/10.1016/s0166-218x(99)00139-0

zbMATH Keywords

accumulated edgevisitability

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 3914345
• Searching for a strong double tracing in a graph
• scientific article; zbMATH DE number 4053381
• On the maximum cardinality search lower bound for treewidth
• The complexity of searching a graph

Cites work

• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• A Sufficient Condition for Backtrack-Free Search

Cited in

(6)

• Triangle width problem: at the intersection of graph theory, scheduling, and matrix visualization
• How to Burn a Graph
• How to hunt an invisible rabbit on a graph
• Dense trees: a new look at degenerate graphs
• Bumblebee visitation problem
• How to Guard a Graph?

This page was built for publication: How to survive while visiting a graph

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