The following pages link to Pierre Charbit (Q458599):
Displayed 32 items.
- The graph formulation of the union-closed sets conjecture (Q458600) (← links)
- The fractional chromatic number of Zykov products of graphs (Q617003) (← links)
- Parameterized complexity of independent set in H-free graphs (Q786045) (← links)
- Perfect graphs of arbitrarily large clique-chromatic number (Q896010) (← links)
- Cyclic orders: equivalence and duality (Q949788) (← links)
- A note on computing set overlap classes (Q975443) (← links)
- A new graph parameter to measure linearity (Q1708605) (← links)
- (Q2012555) (redirect page) (← links)
- Limits of structures and the example of tree semi-lattices (Q2012557) (← links)
- Extension of Gyárfás-Sumner conjecture to digraphs (Q2030749) (← links)
- Revisiting a theorem by Folkman on graph colouring (Q2309226) (← links)
- Enclosings of decompositions of complete multigraphs in 2-edge-connected \(r\)-factorizations (Q2319700) (← links)
- Detecting 2-joins faster (Q2376790) (← links)
- Finding a vector orthogonal to roughly half a collection of vectors (Q2479315) (← links)
- Vertex elimination orderings for hereditary graph classes (Q2514166) (← links)
- Decomposing and colouring some locally semicomplete digraphs (Q2674564) (← links)
- Linear Time Split Decomposition Revisited (Q2910928) (← links)
- (Q2928580) (← links)
- On a Generalization of the Ryser-Brualdi-Stein Conjecture (Q2940993) (← links)
- The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments (Q3429737) (← links)
- χ‐bounded families of oriented graphs (Q4646938) (← links)
- Parameterized Complexity of Independent Set in H-Free Graphs. (Q5009479) (← links)
- EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs (Q5056440) (← links)
- Infinite Locally Random Graphs (Q5384924) (← links)
- Graphs with Large Girth Not Embeddable in the Sphere (Q5428364) (← links)
- Edge clique covers in graphs with independence number two (Q6055943) (← links)
- Improved pyrotechnics: closer to the burning number conjecture (Q6197306) (← links)
- Heroes in oriented complete multipartite graphs (Q6199386) (← links)
- Graphs with large chromatic number induce $3k$-cycles (Q6253803) (← links)
- Decomposing and colouring some locally semicomplete digraphs (Q6362799) (← links)
- (P6, triangle)-free digraphs have bounded dichromatic number (Q6419572) (← links)
- Digraph Colouring and Arc-Connectivity (Q6432653) (← links)