The Complexity of the Hajós Calculus
From MaRDI portal
Publication:4847367
DOI10.1137/S089548019224024XzbMath0834.68090MaRDI QIDQ4847367
Alasdair Urquhart, Toniann Pitassi
Publication date: 18 March 1996
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Complexity of proofs (03F20)
Related Items
Unnamed Item, Grassmann homomorphism and Hajós-type theorems, The complexity of the Hajós calculus for planar graphs, Hajós and Ore constructions for digraphs, LA, permutations, and the Hajós calculus, A Logical Autobiography, Two party immediate response disputes: Properties and efficiency
