22 results on '"Thomassé, Stéphan"'
Search Results
2. Edge-partitioning 3-edge-connected graphs into paths
3. Degeneracy of Pt-free and C⩾t-free graphs with no large complete bipartite subgraphs
4. Graphs with polynomially many minimal separators
5. Disproving the normal graph conjecture
6. Coloring tournaments: From local to global
7. Domination in tournaments
8. A proof of the Barát–Thomassen conjecture
9. Linear kernel for Rooted Triplet Inconsistency and other problems based on conflict packing technique
10. Perfect graphs of arbitrarily large clique-chromatic number
11. Symmetric Determinantal Representations in characteristic 2
12. A linear vertex kernel for maximum internal spanning tree
13. Tournaments and colouring
14. Cyclic orderings and cyclic arboricity of matroids
15. Kernels for feedback arc set in tournaments
16. Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
17. Finding a vector orthogonal to roughly half a collection of vectors
18. A proof of the Erdős–Sands–Sauer–Woodrow conjecture
19. Every strong digraph has a spanning strong subgraph with at most n+2 α−2 arcs
20. Oriented Hamiltonian Paths in Tournaments: A Proof of Rosenfeld's Conjecture
21. Covering a Strong Digraph by α−1 Disjoint Paths: A Proof of Las Vergnas' Conjecture
22. 2-Partition-Transitive Tournaments
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.