Further results on the Aanderaa-Rosenberg conjecture

DOI10.1016/0095-8956(80)90057-XzbMath0357.05069DBLPjournals/jct/KleitmanK80OpenAlexW2080620555WikidataQ56701659 ScholiaQ56701659MaRDI QIDQ1237992

D. J. Kwiatkowski, Daniel J. Kleitman

Publication date: 1980

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(80)90057-x

zbMATH Keywords

graph propertiesevasive

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (3)

On the recognition complexity of some graph properties ⋮ Using Brouwer’s Fixed Point Theorem ⋮ A lower bound for the recognition of digraph properties

Cites Work

• On recognizing graph properties from adjacency matrices
• On the time required to detect cycles and connectivity in graphs
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Further results on the Aanderaa-Rosenberg conjecture