Subgraphs of graphs. I (Q1846887): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q60060511, #quickstatements; #temporary_batch_1707252663060 |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Transversal theory. An account of some aspects of combinatorial mathematics / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Theorem on General Measure Functions / rank | |||
Normal rank | |||
Latest revision as of 14:20, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Subgraphs of graphs. I |
scientific article |
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
