bivariegated graph
graph whose vertex set can be partitioned into two equal parts such that each vertex is adjacent to exactly one vertex from the other set not containing it
| rdfs:label | "bivariegated graph"@en |
|
skos:alt |
"2-variegated graph"@en |
| schema:description |
"graph whose vertex set can be partitioned into two equal parts such that each vertex is adjacent to exactly one vertex from the other set not containing it"@en
|
|
schema:date |
"2025-12-25T23:27:50+00:00"^^xsd:dateTime |
| schema:version | 2447159061 |
| wikibase:identifiers | 1 |
| wikibase:sitelinks | 1 |
| wikibase:statements | 2 |
| p:P279 | wd:statement/Q6322787-3227707d-4e31-036a-34b7-91b34f393c86 |
| p:P646 | wd:statement/Q6322787-9B4C292B-ABA5-465D-B306-DF7CC60E68FE |
| wdt:P279 | graph |
| wdt:P646 | "/m/03yjjdd" |
Download as: