The Complexity of the Hajós Calculus

DOI10.1137/S089548019224024XzbMATH Open0834.68090MaRDI QIDQ4847367FDOQ4847367

Authors: Toniann Pitassi, Alasdair Urquhart 

Publication date: 18 March 1996

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1256654
• Exponential lower bounds for the tree-like Hajós calculus
• The complexity of the Hajós calculus for planar graphs
• scientific article; zbMATH DE number 3313427
• scientific article; zbMATH DE number 4002120

zbMATH Keywords

colorable graphsFrege systemsHajós calculus

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Complexity of proofs (03F20)

Cited In (7)

• Hajós and Ore constructions for digraphs
• The complexity of the Hajós calculus for planar graphs
• Grassmann homomorphism and Hajós-type theorems
• Exact formulae of general sum-connectivity index for some graph operations
• A Logical Autobiography
• Two party immediate response disputes: Properties and efficiency
• LA, permutations, and the Hajós calculus

This page was built for publication: The Complexity of the Hajós Calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4847367)