The following pages link to Marthe Bonamy (Q306249):
Displaying 50 items.
- A \(13k\)-kernel for planar feedback vertex set via region decomposition (Q306250) (← links)
- Strong edge coloring sparse graphs (Q324370) (← links)
- Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable (Q393358) (← links)
- List coloring the square of sparse graphs with large degree (Q740267) (← links)
- On directed feedback vertex set parameterized by treewidth (Q1627154) (← links)
- Planar graphs of girth at least five are square \((\delta + 2)\)-choosable (Q1633752) (← links)
- Independent feedback vertex sets for graphs of bounded diameter (Q1685021) (← links)
- Recoloring graphs via tree decompositions (Q1686264) (← links)
- Token sliding on chordal graphs (Q1687909) (← links)
- On a conjecture of Mohar concerning Kempe equivalence of regular graphs (Q1719578) (← links)
- Gallai's path decomposition conjecture for graphs of small maximum degree (Q1732759) (← links)
- Independent feedback vertex set for \(P_5\)-free graphs (Q1739097) (← links)
- On the difference between the Szeged and the Wiener index (Q1740024) (← links)
- Frozen colourings of bounded degree graphs (Q1792087) (← links)
- Dominating sets reconfiguration under token sliding (Q2032965) (← links)
- A note on deterministic zombies (Q2032975) (← links)
- Colouring graphs with sparse neighbourhoods: bounds and applications (Q2131867) (← links)
- Partitioning the vertices of a torus into isomorphic subgraphs (Q2174951) (← links)
- Avoidable paths in graphs (Q2215468) (← links)
- A note on connected greedy edge colouring (Q2231754) (← links)
- Jones' conjecture in subcubic graphs (Q2236806) (← links)
- Graph isomorphism for \((H_1,H_2)\)-free graphs: an almost complete dichotomy (Q2285091) (← links)
- Revisiting a theorem by Folkman on graph colouring (Q2309226) (← links)
- Distributed coloring in sparse graphs with fewer colors (Q2335690) (← links)
- Incidence coloring of graphs with high maximum average degree (Q2357131) (← links)
- Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← links)
- Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs (Q2436666) (← links)
- Brooks' theorem on powers of graphs (Q2449134) (← links)
- Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy (Q2661991) (← links)
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (Q2664559) (← links)
- On Vizing's edge colouring question (Q2680572) (← links)
- Planar graphs with $\Delta\geq 7$ and no triangle adjacent to a $C_4$ are minimally edge and total choosable (Q2808541) (← links)
- The Erdös--Hajnal Conjecture for Long Holes and Antiholes (Q2813338) (← links)
- (Q2857337) (← links)
- (Q2857338) (← links)
- 2-Distance Coloring of Sparse Graphs (Q2930038) (← links)
- A $$14k$$ -Kernel for Planar Feedback Vertex Set via Region Decomposition (Q2946011) (← links)
- Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable (Q2947439) (← links)
- List Coloring with a Bounded Palette (Q2958200) (← links)
- On the Neighbor Sum Distinguishing Index of Planar Graphs (Q4978296) (← links)
- Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants (Q4987460) (← links)
- Frozen (Δ + 1)-colourings of bounded degree graphs (Q4993126) (← links)
- Limiting Crossing Numbers for Geodesic Drawings on the Sphere (Q5014128) (← links)
- (Q5051743) (← links)
- EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs (Q5056440) (← links)
- Enumerating Minimal Dominating Sets in Triangle-Free Graphs (Q5090462) (← links)
- Distributed Recoloring (Q5090902) (← links)
- The Perfect Matching Reconfiguration Problem (Q5092444) (← links)
- Recognizing Graphs Close to Bipartite Graphs (Q5111287) (← links)
- Tight Lower Bounds for the Complexity of Multicoloring (Q5111704) (← links)