Skip to content
Book Bag:
0
items
(Full)
Login
Language
English
Slovak
Catalog
Catalog Books
Articles
Catalog ONDV
Catalog OND
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Find
Advanced
On the size of a minimal verte...
Cite this
Print
Export Record
Export to MARC
Export to BibTeX
Export to Jednoduchý textový výpis
Export to ISBD (text)
Export to Citácia ISO 690 (HTML)
Export to Citácia ISO 690 (.doc)
Add to Book Bag
Remove from Book Bag
Permanent link
On the size of a minimal vertex cover in a random subgraph of the n-cube
Show other versions (1)
Bibliographic Details
Main Authors:
Toman, Eduard
(Author)
,
Stanek, Martin
(Author)
Format:
Article
Language:
English
Subjects:
náhodné grafy
podgrafy
n-kocky
vrcholové pokrytie grafu
štúdie
Pozri predplatné
Predplatné
Kliknite na „Pozri predplatné“.
Holdings
Description
Other Versions (1)
Similar Items
Staff View
Similar Items
On structural properties of random subgraphs of n-cube
by: Toman, Eduard, et al.
Analysis of greedy algorithm for vertex covering of random graph by cubes
by: Toman, Eduard, et al.
On the number of regular vertices and kernel subgraphs in random graphs
by: Toman, Eduard, et al.
Induced subgraphs with the same order and size
by: Bosák, Juraj, 1933-1987
Ocenka radiusa slučajnogo podgrafa n-mernogo kuba
by: Toman, Eduard
