On a certain complexity estimate in graph theory

From MaRDI portal

Revision as of 14:51, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1358054

Jump to:navigation, search

DOI10.1007/BF02104862zbMath0874.03044MaRDI QIDQ1358054

Sergeĭ Vladimirovich Sudoplatov

Publication date: 14 August 1997

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

cycle block first-order theory connected component cutpoint \(n\)-theory weakly saturated graph weakly saturated model

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Models with special properties (saturated, rigid, etc.) (03C50) Models of other mathematical theories (03C65)

Related Items (2)

The number of models for theories of everywhere finitely defined polygonometries ⋮ Transitive arrangements of algebraic systems

Cites Work

Superstable graphs

This page was built for publication: On a certain complexity estimate in graph theory

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1358054&oldid=13505095"