On graph equivalences preserved under extensions

DOI10.1016/J.DISC.2011.02.029zbMath1216.05036arXiv1002.1749OpenAlexW1977603542MaRDI QIDQ536221

Zbigniew Lonc, Miroslaw Truszczynski

Publication date: 16 May 2011

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

Full work available at URL: https://arxiv.org/abs/1002.1749

zbMATH Keywords

computational complexityconnectivitygeneral graph propertiesstrong equivalence of graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45) Graph designs and isomorphic decomposition (05C51)

Related Items (3)

Characterizing strong equivalence for argumentation frameworks ⋮ Bundling all shortest paths ⋮ A general notion of equivalence for abstract argumentation

Cites Work

• Characterizing strong equivalence for argumentation frameworks
• Strong equivalence made easy: nested expressions and weight constraints
• Semantical characterizations and complexity of equivalences in answer set programming
• A common view on strong, uniform, and other notions of equivalence in answer-set programming
• Strongly equivalent logic programs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On graph equivalences preserved under extensions