On graph equivalences preserved under extensions
type: Item
instance of: scholarly article
title: On graph equivalences preserved under extensions
zbMATH Open document ID: 1216.05036
author: Zbigniew Lonc
author: Mirosław Truszczyński
published in: Discrete Mathematics
publication date: 2011-05-16T00:00:00Z
full work available at URL: https://arxiv.org/abs/1002.1749
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C51
zbMATH DE Number: 5888520
zbMATH Keywords: strong equivalence of graphs
zbMATH Keywords: general graph properties
zbMATH Keywords: computational complexity
zbMATH Keywords: connectivity
MaRDI profile type: Publication
OpenAlex ID: W1977603542
arXiv ID: 1002.1749
cites work: Q3735050
cites work: Q4947393
cites work: Semantical characterizations and complexity of equivalences in answer set programming
cites work: Q4198056
cites work: Strongly equivalent logic programs
cites work: Characterizing strong equivalence for argumentation frameworks
cites work: Strong equivalence made easy: nested expressions and weight constraints
cites work: A common view on strong, uniform, and other notions of equivalence in answer-set programming
DOI: 10.1016/J.DISC.2011.02.029
description: scientific article