The Complexity of the Hajós Calculus

DOI10.1137/S089548019224024XMaRDI QIDQ4847367zbMATH OpenFDO

Authors Toniann Pitassi, Alasdair Urquhart

Publication date 18 March 1996

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

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)

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

Cited in

(7)

• Hajós and Ore constructions for digraphs
• Grassmann homomorphism and Hajós-type theorems
• The complexity of the Hajós calculus for planar graphs
• 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)