Graph Theory

1979/01/01 by Béla Bollobás · 12 citations
Computer Science · #Advanced Graph Theory Research

paper · doi:10.1007/978-1-4612-9967-7

crossref issued 1979/01/01 · crossref published 1979/01/01 · crossref published-print 1979/01/01 · openalex publication_date 1979/01/01 · crossref created 2011/10/10 · crossref deposited 2019/04/06 · openalex created_date 2022/02/08 · crossref indexed 2026/06/16 · openalex updated_date 2026/07/28

Cited by

• On polynomial digraphs
• Scale-free networks in cell biology
• Hadwiger's Conjecture is True for Almost Every Graph
• Generating random spanning trees more quickly than the cover time
• Efficient parallel algorithms for edge coloring problems
• The reversing number of a diagraph
• Planar unit-distance graphs having planar unit-distance complement
• Triangle-free four-chromatic graphs
• Precise asymptotics of some meeting times arising from the voter model on large random regular graphs
• CO-MAXIMAL IDEAL GRAPHS OF COMMUTATIVE RINGS
• An NC algorithm for Brooks' Theorem
• Béla Bollobás [wikipedia]