The complexity of finite graphs

MaRDI QIDQ1363999zbMATH OpenFDO

Authors A. V. Chashkin

Publication date 20 August 1997

Published in Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

Boolean functionscircuitscomplexitygenerating graphsinteger sequenceShannon functions

Mathematics Subject Classification ID

Graph theory (05C99)

Review text

This work concerns the complexity of finite undirected graphs, including bipartite graphs, generated by circuits of functional elements. The graphs under consideration have neither loops nor multiple edges and the vertices of these graphs are numbered.

Recommendations

• Computational complexity of graphs
• On Graph Complexity
• The complexity of a class of infinite graphs
• The linear complexity of a graph
• The linear complexity of a graph
• scientific article; zbMATH DE number 1071771
• On a certain complexity estimate in graph theory
• Graph complexity
• scientific article; zbMATH DE number 3874609
• scientific article; zbMATH DE number 3874608

Cited in

(12)

• A bound for the complexity of a simple graph
• The complexity of a class of infinite graphs
• On the complexity of finite subgraphs of the curve graph
• Graph complexity
• scientific article; zbMATH DE number 3874608 (Why is no real title available?)
• scientific article; zbMATH DE number 3876594 (Why is no real title available?)
• Complexity of computation of some functions of graphs
• Computational complexity of graphs
• scientific article; zbMATH DE number 3499653 (Why is no real title available?)
• scientific article; zbMATH DE number 219271 (Why is no real title available?)
• MAX-plus objects to study the complexity of graphs
• The complexity of growing 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)