Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Back to Simple Search

Advanced Search

Match of the following rules

Add Another Rule

Contains the following math formula (red border means the formula is incomplete)

Formula preview

Currently displaying 1 – 1 of 1

Order by Relevance | Title | Year of publication

On partitionable, confidentially connected and unbreakable graphs.

Talmaciu, M.; Nechita, E. — 2011

Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică

Page 1

Download Results (CSV)