|
Discrete mathematics and mathematical cybernetics
Perfect orientation colorings of cubic graphs
T. E. Kireeva Sobolev Institute of Mathematics,
pr. Koptyuga, 4,
630090, Novosibirsk, Russia
Abstract:
In this work we extend concept of perfect coloring for directed graph. We use computer algorithm to get all allowable matrices of parameters for perfect orientation colorings of cubic graphs. For each matrix of parameters we show examples of coloring for corresponding minimal graphs.
Keywords:
сubic graph, directed graph, perfect coloring, perfect orientation coloring.
Received November 3, 2017, published November 1, 2018
Citation:
T. E. Kireeva, “Perfect orientation colorings of cubic graphs”, Sib. Èlektron. Mat. Izv., 15 (2018), 1353–1360
Linking options:
https://www.mathnet.ru/eng/semr1002 https://www.mathnet.ru/eng/semr/v15/p1353
|
Statistics & downloads: |
Abstract page: | 173 | Full-text PDF : | 40 | References: | 27 |
|