The following pages link to Frédéric Mazoit (Q414639):
Displaying 15 items.
- Tree-width of hypergraphs and surface duality (Q414640) (← links)
- (Q819829) (redirect page) (← links)
- Listing all the minimal separators of a 3-connected planar graph (Q819830) (← links)
- Monotonicity of non-deterministic graph searching (Q930888) (← links)
- Partitions versus sets: a case of duality (Q966122) (← links)
- Computing branchwidth via efficient triangulations and blocks (Q967315) (← links)
- Submodular partition functions (Q1045090) (← links)
- Chordal embeddings of planar graphs (Q1417569) (← links)
- Tree-width of graphs and surface duality (Q2839216) (← links)
- Constructing Brambles (Q3182927) (← links)
- Treewidth of planar graphs: connections with duality (Q3438941) (← links)
- Monotonicity of Non-deterministic Graph Searching (Q3508552) (← links)
- The Branch-Width of Circular-Arc Graphs (Q3525805) (← links)
- (Q5421816) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897571) (← links)
