On a certain complexity estimate in graph theory
From MaRDI portal
Publication:1358054
DOI10.1007/BF02104862zbMath0874.03044MaRDI QIDQ1358054
Sergeĭ Vladimirovich Sudoplatov
Publication date: 14 August 1997
Published in: Siberian Mathematical Journal (Search for Journal in Brave)
cycleblockfirst-order theoryconnected componentcutpoint\(n\)-theoryweakly saturated graphweakly saturated model
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
This page was built for publication: On a certain complexity estimate in graph theory
