The following pages link to Fábio Botler (Q1689901):
Displaying 26 items.
- (Q322338) (redirect page) (← links)
- Path decompositions of regular graphs with prescribed girth (Q322341) (← links)
- Decompositions of highly connected graphs into paths of any given length (Q324373) (← links)
- On path decompositions of \(2k\)-regular graphs (Q324765) (← links)
- Decompositions of highly connected graphs into paths of length five (Q324786) (← links)
- Decomposing highly edge-connected graphs into paths of any given length (Q345101) (← links)
- Decomposition of 8-regular graphs into paths of length 4 (Q1689903) (← links)
- Gallai's path decomposition conjecture for triangle-free planar graphs (Q1732776) (← links)
- Decomposing highly connected graphs into paths of length five (Q1752489) (← links)
- Decomposition of \((2k + 1)\)-regular graphs containing special spanning \(2k\)-regular Cayley graphs into paths of length \(2k + 1\) (Q2142644) (← links)
- Decompositions of triangle-free 5-regular graphs into paths of length five (Q2352046) (← links)
- Decomposing 8-regular graphs into paths of length 4 (Q2359970) (← links)
- On path decompositions of \(2 k\)-regular graphs (Q2400577) (← links)
- Decomposing regular graphs with prescribed girth into paths of given length (Q2403689) (← links)
- Gallai's conjecture for graphs with treewidth 3 (Q2413163) (← links)
- Counting orientations of graphs with no strongly connected tournaments (Q2675820) (← links)
- (Q3305730) (← links)
- Gallai's path decomposition conjecture for graphs with treewidth at most 3 (Q5110660) (← links)
- (Q5420032) (← links)
- (Q5884595) (← links)
- The mod k $k$ chromatic index of random graphs (Q6047962) (← links)
- Towards Gallai's path decomposition conjecture (Q6055934) (← links)
- Seymour's second neighborhood conjecture for orientations of (pseudo)random graphs (Q6080532) (← links)
- The mod k $k$ chromatic index of graphs is O(k) $O(k)$ (Q6093146) (← links)
- Separating the edges of a graph by a linear number of paths (Q6423970) (← links)
- Decomposition of graphs into trees with bounded maximum degree (Q6492326) (← links)
