Further results on the Aanderaa-Rosenberg conjecture

DOI10.1016/0095-8956(80)90057-XMaRDI QIDQ1237992zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Daniel J. Kleitman, D. J. Kwiatkowski

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)

Cites work

• scientific article; zbMATH DE number 3460321 (Why is no real title available?)
• scientific article; zbMATH DE number 3558963 (Why is no real title available?)
• scientific article; zbMATH DE number 3557238 (Why is no real title available?)
• scientific article; zbMATH DE number 3617539 (Why is no real title available?)
• Depth-First Search and Linear Graph Algorithms
• On recognizing graph properties from adjacency matrices
• On the time required to detect cycles and connectivity in graphs

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1237992)