The following pages link to Florent Foucaud (Q311494):
Displaying 23 items.
- The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction (Q5405070) (← links)
- (Q5875547) (← links)
- Monitoring the edges of a graph using distances (Q5896103) (← links)
- Parameterizing path partitions (Q6057329) (← links)
- (Q6065396) (← links)
- Discriminating Codes in Geometric Setups (Q6065423) (← links)
- Neighbourhood complexity of graphs of bounded twin-width (Q6081102) (← links)
- Complexity and approximation for discriminating and identifying code problems in geometric setups (Q6107885) (← links)
- New bounds and constructions for neighbor-locating colorings of graphs (Q6132528) (← links)
- Monitoring edge-geodetic sets in graphs (Q6132539) (← links)
- On three domination-based identification problems in block graphs (Q6132542) (← links)
- Relation between broadcast domination and multipacking numbers on chordal graphs (Q6132545) (← links)
- Bounds and extremal graphs for total dominating identifying codes (Q6133156) (← links)
- The \textsc{Red-Blue Separation} problem on graphs (Q6168089) (← links)
- Extended double covers and homomorphism bounds of signed graphs (Q6199191) (← links)
- Extremal Digraphs for open neighbourhood location-domination and identifying codes (Q6202938) (← links)
- On powers of interval graphs and their orders (Q6261767) (← links)
- Complexity and algorithms for injective edge-coloring in graphs (Q6365437) (← links)
- On graphs coverable by k shortest paths (Q6403599) (← links)
- Progress towards the two-thirds conjecture on locating-total dominating sets (Q6418463) (← links)
- Isometric path complexity of graphs (Q6422222) (← links)
- Algorithms and hardness for Metric Dimension on digraphs (Q6444186) (← links)
- Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs (Q6463872) (← links)