The complexity of finite graphs

zbMATH Open0877.05058MaRDI QIDQ1363999

A. V. Chashkin

Publication date: 20 August 1997

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

zbMATH Keywords

complexityBoolean functionscircuitsinteger sequencegenerating graphsShannon functions

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (6)

On the complexity of finite subgraphs of the curve graph ⋮ A bound for the complexity of a simple graph ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ The complexity of growing a graph ⋮ The complexity of a class of infinite graphs

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The linear complexity of a graph 👍 👎
• The complexity of a class of infinite graphs 👍 👎
• On a certain complexity estimate in graph theory 👍 👎
• Graph complexity 👍 👎
• On Graph Complexity 👍 👎
• Computational Complexity of Graphs 👍 👎
• The Linear Complexity of a Graph 👍 👎

This page was built for publication: The complexity of finite graphs

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