Pages that link to "Item:Q4667860"

The following pages link to How complex are random graphs in first order logic? (Q4667860):

Displaying 16 items.

• Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
• On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs (Q786037) (← links)
• The first order definability of graphs: Upper bounds for quantifier depth (Q860411) (← links)
• Separating codes and traffic monitoring (Q1704860) (← links)
• Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
• Locating-dominating sets and identifying codes in graphs of girth at least 5 (Q2344817) (← links)
• Succinct definitions in the first order theory of graphs (Q2368907) (← links)
• Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
• Decomposable graphs and definitions with no quantifier alternation (Q2461780) (← links)
• Characterization of product anti-magic graphs of large order (Q2478164) (← links)
• The complexity of random ordered structures (Q2478557) (← links)
• The first order definability of graphs with separators via the Ehrenfeucht game (Q2570131) (← links)
• Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs (Q2827829) (← links)
• Separating Codes and Traffic Monitoring (Q2830061) (← links)
• (Q3121527) (← links)
• On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs (Q5009472) (← links)