Searching expenditure and interval graphs

DOI10.1016/S0166-218X(02)00297-4zbMath0913.05059WikidataQ60488776 ScholiaQ60488776MaRDI QIDQ4242800

Fedor V. Fomin

Publication date: 11 May 1999

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

zbMATH Keywords

pursuit-evasiontree-widthpebblinggraph searchinggame on a graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Games involving graphs (91A43) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• On minimizing width in linear layouts
• The vertex separation and search number of a graph
• Fugitive-search games on graphs and related parameters
• Searching and pebbling
• Topological Bandwidth
• The complexity of searching a graph
• Optimal Algorithms for a Pursuit-Evasion Problem in Grids
• Monotonicity in graph searching
• The total vertex separation number and profile of a graph
• Recontamination does not help to search a graph
• Eavesdropping games
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Searching expenditure and interval graphs