András Gyárfás
2003–2011
A researcher in the Science corpus: 3 papers; trusts 3 researchers and is trusted by 3 researchers here, as inferred from the citation graph.
Whom András Gyárfás trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts András Gyárfás overall
Papers from András Gyárfás's perspective
Ordered by how strongly the researchers András Gyárfás trusts endorse each paper. Same corpus, a different order for every researcher.
- NP completeness of the edge precoloring extension problem on bipartite graphs
- Edge colorings of complete graphs without tricolored triangles
- Chromatic-index critical multigraphs of order 20
- Product Graphs: Structure and Recognition
- Circular chromatic number: a survey (Discrete Mathematics)
- The triangle-free process
- Integrals, partitions, and cellular automata
- Majority bootstrap percolation on the random graph G(n,p)
- A simple model of global cascades on random networks (Proceedings of the National Academy of Sciences of the United States of America)
- The phase transition in inhomogeneous random graphs (Random Struct. Algorithms)
Their papers
- Edge colorings of complete graphs without tricolored triangles (2004) — 180 citations
- Large Monochromatic Components in Edge Colorings of Graphs: A Survey (2011) — 49 citations
- Edge list multicoloring trees: An extension of Hall's theorem (2003) — 53 citations