How to survive while visiting a graph

DOI10.1016/S0166-218X(99)00139-0zbMath0940.05062OpenAlexW2071028712MaRDI QIDQ1962049

Enrico Nardelli, Claudio Arbib, 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 theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Dense trees: a new look at degenerate graphs

Cites Work

• A Sufficient Condition for Backtrack-Free Search
• Unnamed Item
• Unnamed Item
• Unnamed Item

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