Working Graphs
Metascience 14 (2):293-295 (2005)
Abstract
This article has no associated abstract. (fix it)Author's Profile
My notes
Similar books and articles
Expansions of Ultrahomogeneous Graphs.J. E. Helmreich - 1995 - Notre Dame Journal of Formal Logic 36 (3):414-424.
Small universal families for graphs omitting cliques without GCH.Katherine Thompson - 2010 - Archive for Mathematical Logic 49 (7-8):799-811.
Game-theoretical semantics for Peirce's existential graphs.Robert W. Burch - 1994 - Synthese 99 (3):361 - 375.
Some natural decision problems in automatic graphs.Dietrich Kuske & Markus Lohrey - 2010 - Journal of Symbolic Logic 75 (2):678-710.
Graphs with ∏ 1 0 (K)Y-sections.Boško Živaljević - 1993 - Archive for Mathematical Logic 32 (4):259-273.
Reachability is harder for directed than for undirected finite graphs.Miklos Ajtai & Ronald Fagin - 1990 - Journal of Symbolic Logic 55 (1):113-150.
Domatic partitions of computable graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2014 - Archive for Mathematical Logic 53 (1-2):137-155.
Why do mathematicians need different ways of presenting mathematical objects? The case of cayley graphs.Irina Starikova - 2010 - Topoi 29 (1):41-51.
Chemical Graph Theory and the Sherlock Holmes Principle.Alexandru T. Balaban - 2013 - Hyle 19 (1):107 - 134.
Analytics
Added to PP
2013-12-01
Downloads
8 (#989,199)
6 months
1 (#452,962)
2013-12-01
Downloads
8 (#989,199)
6 months
1 (#452,962)
Historical graph of downloads