On the recognition complexity of some graph properties
type: Item
instance of: scholarly article
title: On the recognition complexity of some graph properties
zbMATH Open document ID: 0868.68088
DOI: 10.1007/BF01844851
author: Eberhard Triesch
published in: Combinatorica
publication date: 1997-08-03T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 05C25
zbMATH DE Number: 936876
zbMATH Keywords: bipartite graphs
Wikidata QID: Q56701667
MaRDI profile type: Publication
cites work: Q4046079
cites work: Complete subgraphs are elusive
cites work: Some results on the complexity of families of sets
cites work: La structure des $p$-groupes de Sylow des groupes symétriques finis
cites work: A lower bound for the recognition of digraph properties
cites work: Further results on the Aanderaa-Rosenberg conjecture
cites work: A topological approach to evasiveness
cites work: Q3999472
cites work: Fixed-point sets of group actions on finite acyclic complexes
cites work: On recognizing graph properties from adjacency matrices
cites work: Fixed-Point Theorems for Periodic Transformations
cites work: Q5522742
cites work: Q3680877
cites work: Q4728247
cites work: Some Results on Elusive Graph Properties
cites work: Monotone Bipartite Graph Properties are Evasive
full work available at URL: https://doi.org/10.1007/bf01844851
OpenAlex ID: W2079486985
description: scientific article; zbMATH DE number 936876