Louis Esperet
2010–2017
A researcher in the Science corpus: 2 papers; trusts 1 researcher and is trusted by 0 researchers here, as inferred from the citation graph.
Whom Louis Esperet trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Louis Esperet's perspective
Ordered by how strongly the researchers Louis Esperet trusts endorse each paper. Same corpus, a different order for every researcher.
- The Complexity of Computing the Permanent
- Graphs on Surfaces (Johns Hopkins series in the mathematical sciences)
- Graph Coloring Problems
- I and J
- Coloring intersection graphs of geometric figures with a given clique number
- Which graphs are determined by their spectrum
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- Spectra of Graphs
- The Laplacian spectrum of graphs
- Skew-adjacency matrices of graphs
Their papers
- Graph colorings, flows and perfect matchings (2017) — 47 citations
- Exponentially many perfect matchings in cubic graphs (2010) — 63 citations