The following pages link to François Dross (Q317408):
Displayed 31 items.
- A lower bound on the order of the largest induced forest in planar graphs with high girth (Q317411) (← links)
- Complexity of planar signed graph homomorphisms to cycles (Q777377) (← links)
- Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs (Q777380) (← links)
- Computing small pivot-minors (Q1627161) (← links)
- Large induced forests in planar graphs with girth 4 (Q1720314) (← links)
- A lower bound on the order of the largest induced linear forest in triangle-free planar graphs (Q1727766) (← links)
- Partitioning sparse graphs into an independent set and a forest of bounded degree (Q1753010) (← links)
- Maximal Wiener index for graphs with prescribed number of blocks (Q2180710) (← links)
- Partitioning sparse graphs into an independent set and a graph with bounded size components (Q2185923) (← links)
- Jones' conjecture in subcubic graphs (Q2236806) (← links)
- The structure of graphs with given number of blocks and the maximum Wiener index (Q2292137) (← links)
- Note on 3-choosability of planar graphs with maximum degree 4 (Q2324500) (← links)
- Vertex partitions of \((C_3, C_4, C_6)\)-free planar graphs (Q2324512) (← links)
- Colouring diamond-free graphs (Q2402373) (← links)
- Decomposing degenerate graphs into locally irregular subgraphs (Q2657056) (← links)
- Generalising the achromatic number to Zaslavsky's colourings of signed graphs (Q2672623) (← links)
- The complexity of two colouring games (Q2696280) (← links)
- Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs (Q2798222) (← links)
- Filling the complexity gaps for colouring planar and bounded degree graphs (Q3299212) (← links)
- Fractional Triangle Decompositions in Graphs with Large Minimum Degree (Q3462543) (← links)
- Tree Pivot-Minors and Linear Rank-Width (Q5020842) (← links)
- (Q5130733) (← links)
- (Q5369518) (← links)
- Powers of paths in tournaments (Q5886115) (← links)
- Partitioning a triangle-free planar graph into a forest and a forest of bounded degree (Q5890907) (← links)
- On the unavoidability of oriented trees (Q5918100) (← links)
- On the unavoidability of oriented trees (Q5918670) (← links)
- 1-planar graphs with minimum degree at least 3 have bounded girth (Q6332932) (← links)
- Generalising the achromatic number to Zaslavsky's colourings of signed graphs (Q6378776) (← links)
- Separating the edges of a graph by a linear number of paths (Q6423970) (← links)
- Computing pivot-minors (Q6458553) (← links)