| Display title | Shannon multigraph |
| Default sort key | Shannon multigraph |
| Page length (in bytes) | 3,778 |
| Namespace ID | 0 |
| Page ID | 241997 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>JOpenQuest |
| Date of page creation | 09:08, 27 June 2023 |
| Latest editor | imported>JOpenQuest |
| Date of latest edit | 09:08, 27 June 2023 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In the mathematical discipline of graph theory, Shannon multigraphs, named after Claude Shannon by (Vizing 1965), are a special type of triangle graphs, which are used in the field of edge coloring in particular.
A Shannon multigraph is multigraph with 3 vertices for which either of the following conditions... |
