Subgraphs of graphs. I (Q1846887)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3453655
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Subgraphs of graphs. I |
scientific article; zbMATH DE number 3453655 |
Statements
Subgraphs of graphs. I (English)
0 references
1974
0 references
Let \(G\) and \(H\) be two simple graphs on \(g\) vertices. We give a sufficient condition, based on the minimum degree of the vertices of \(G\) and the maximum degree of the vertices of \(H\), for \(H\) to be a subgraph of \(G\).
0 references
simple graphs
0 references
subgraph
0 references
minimum degree of vertices
0 references
maximum degree of vertices
0 references
0.8278197050094604
0 references
0.7736450433731079
0 references
