The following pages link to Florent Foucaud (Q311494):
Displayed 50 items.
- Locating-total dominating sets in twin-free graphs: a conjecture (Q311495) (← links)
- Location-domination in line graphs (Q329538) (← links)
- Identifying path covers in graphs (Q396675) (← links)
- Locally identifying colourings for graphs with given maximum degree (Q418899) (← links)
- Bounds for identifying codes in terms of degree parameters (Q426794) (← links)
- On the size of identifying codes in triangle-free graphs (Q427898) (← links)
- Random subgraphs make identification affordable (Q501982) (← links)
- Structural properties of recursively partitionable graphs with connectivity 2 (Q505469) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
- On the structure of arbitrarily partitionable graphs with given connectivity (Q741769) (← links)
- Domination and location in twin-free digraphs (Q777359) (← links)
- Complexity of planar signed graph homomorphisms to cycles (Q777377) (← links)
- Hardness and approximation for the geodetic set problem in some graph classes (Q779181) (← links)
- Smallest \(C_{2l+1}\)-critical graphs of odd-girth \(2k+1\) (Q779195) (← links)
- Locating-dominating sets in twin-free graphs (Q906432) (← links)
- Location-domination and matching in cubic graphs (Q906465) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- Complexity of Grundy coloring and its variants (Q1752449) (← links)
- On the complexity of broadcast domination and multipacking In digraphs (Q1979448) (← links)
- Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs (Q1989955) (← links)
- The complexity of tropical graph homomorphisms (Q2012054) (← links)
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
- Complexity and algorithms for injective edge-coloring in graphs (Q2032162) (← links)
- Characterizing extremal graphs for open neighbourhood location-domination (Q2043360) (← links)
- Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity (Q2134740) (← links)
- Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\) (Q2161276) (← links)
- The \textsc{red-blue separation} problem on graphs (Q2169962) (← links)
- Complexity of conjunctive regular path query homomorphisms (Q2179353) (← links)
- Strengthening the Murty-Simon conjecture on diameter 2 critical graphs (Q2324502) (← links)
- Locating-dominating sets and identifying codes in graphs of girth at least 5 (Q2344817) (← links)
- The complexity of signed graph and edge-coloured graph homomorphisms (Q2374178) (← links)
- Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets (Q2376092) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
- Homomorphism bounds of signed bipartite \(K_4\)-minor-free graphs and edge-colorings of \(2k\)-regular \(K_4\)-minor-free multigraphs (Q2414452) (← links)
- Extremal graphs for the identifying code problem (Q2430979) (← links)
- An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid (Q2437959) (← links)
- Exact square coloring of subcubic planar graphs (Q2659166) (← links)
- Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs (Q2827829) (← links)
- (Q2857369) (← links)
- The Complexity of the Identifying Code Problem in Restricted Graph Classes (Q2870024) (← links)
- On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths (Q2876554) (← links)
- Large Subgraphs without Short Cycles (Q3453565) (← links)
- Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension (Q4636778) (← links)
- Centroidal bases in graphs (Q4642472) (← links)
- On the Complexity of Broadcast Domination and Multipacking in Digraphs (Q5041195) (← links)
- Revisiting and Improving Upper Bounds for Identifying Codes (Q5048300) (← links)
- (Q5104254) (← links)
- Broadcast domination and multipacking: bounds and the integrality gap (Q5197586) (← links)
- Identifying Codes in Line Graphs (Q5325952) (← links)
- Parameterized and approximation complexity of the detection pair problem in graphs (Q5371038) (← links)