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
Almost every bipartite graph h...
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
Almost every bipartite graph has not two vertices of minimum degree
Bibliographic Details
Main Author:
Bukor, Jozef
(Author)
Format:
Article
Language:
Slovak
English
Subjects:
grafy dvojdielne
články z novín a časopisov
Pozri predplatné
Predplatné
Kliknite na „Pozri predplatné“.
Holdings
Description
Similar Items
Staff View
Similar Items
The sum of all distances in bipartite graphs
by: Gutman, Ivan, et al.
Quadrilateral embeddings of the conjunction of graphs
by: Železník, Vladimír
Homomorphisms of finite bipartite graphs onto complete bipartite graphs
by: Zelinka, Bohdan, 1940-2005
Domatic number and degrees of vertices of a graphs
by: Zelinka, Bohdan, 1940-2005
Total domatic number and degrees of vertices of a graph
by: Zelinka, Bohdan, 1940-2005
