Degenerovaný graf nebo k-degenerovaný graf je v teorii grafů graf, jehož každý podgraf obsahuje vrcholy stupně nejvýše k.
| Property | Value |
|---|---|
| prop-cs:wikiPageUsesTemplate | |
| dbpedia-owl:abstract |
|
| dbpedia-owl:thumbnail | |
| dbpedia-owl:wikiPageID |
|
| dbpedia-owl:wikiPageLength |
|
| dbpedia-owl:wikiPageOutDegree |
|
| dbpedia-owl:wikiPageRevisionID |
|
| dbpedia-owl:wikiPageWikiLink | |
| dbpedia-owl:wikiPageWikiLinkText |
|
| dcterms:subject | |
| rdfs:comment |
|
| rdfs:label |
|
| prov:wasDerivedFrom | |
| foaf:depiction | |
| foaf:isPrimaryTopicOf | |
| is dbpedia-owl:wikiPageWikiLink of | |
| is foaf:primaryTopic of |
