Mycielski/mycielskian3
Mycielskian graph M3
| Name | mycielskian3 |
|---|---|
| Group | Mycielski |
| Matrix ID | 2759 |
| Num Rows | 5 |
| Num Cols | 5 |
| Nonzeros | 10 |
| Pattern Entries | 10 |
| Kind | Undirected Graph |
| Symmetric | Yes |
| Date | 2018 |
| Author | J. Mycielski |
| Editor | S. Kolodziej |
| Download | MATLAB Rutherford Boeing Matrix Market |
|---|---|
| Notes |
Mycielskian graph M3.
The Mycielskian graph sequence generates graphs that are triangle-free
and with a known chromatic number (i.e. the minimum number of colors
required to color the vertices of the graph).
Known properties of this graph (M3) include the following:
* M3 has a minimum chromatic number of 3.
* M3 is triangle-free (i.e. no cycles of length 3 exist).
* M3 has a Hamiltonian cycle.
* M3 has a clique number of 2.
* M3 is factor-critical, meaning every subgraph of |V|-1 vertices has
a perfect matching.
Mycielski graphs were first described by Jan Mycielski in the following
publication:
Mycielski, J., 1955. Sur le coloriage des graphes. Colloq. Math.,
3: 161-162.
|