bivariegated graph (Q6322787)
Jump to navigation
Jump to search
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
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 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 |
Statements
Identifiers
Sitelinks
Wikipedia(1 entry)
- enwiki Bivariegated graph