volume 3 issue 1 pages 144-147

On incidentor coloring in a hypergraph

Publication typeJournal Article
Publication date2009-01-01
scimago Q3
SJR0.315
CiteScore1.0
Impact factor
ISSN19904789, 19904797
Industrial and Manufacturing Engineering
Applied Mathematics
Abstract
The problem is considered of the incidentor p-coloring of directed and undirected hypergraphs. The exact lower and upper bounds are given of the minimum necessary number of colors.
Found 

Are you a researcher?

Create a profile to get free access to personal recommendations for colleagues and new articles.
Metrics
0
Share
Cite this
GOST |
Cite this
GOST Copy
Vizing V. On incidentor coloring in a hypergraph // Journal of Applied and Industrial Mathematics. 2009. Vol. 3. No. 1. pp. 144-147.
GOST all authors (up to 50) Copy
Vizing V. On incidentor coloring in a hypergraph // Journal of Applied and Industrial Mathematics. 2009. Vol. 3. No. 1. pp. 144-147.
RIS |
Cite this
RIS Copy
TY - JOUR
DO - 10.1134/s1990478909010165
UR - https://doi.org/10.1134/s1990478909010165
TI - On incidentor coloring in a hypergraph
T2 - Journal of Applied and Industrial Mathematics
AU - Vizing, V.G.
PY - 2009
DA - 2009/01/01
PB - Pleiades Publishing
SP - 144-147
IS - 1
VL - 3
SN - 1990-4789
SN - 1990-4797
ER -
BibTex |
Cite this
BibTex (up to 50 authors) Copy
@article{2009_Vizing,
author = {V.G. Vizing},
title = {On incidentor coloring in a hypergraph},
journal = {Journal of Applied and Industrial Mathematics},
year = {2009},
volume = {3},
publisher = {Pleiades Publishing},
month = {jan},
url = {https://doi.org/10.1134/s1990478909010165},
number = {1},
pages = {144--147},
doi = {10.1134/s1990478909010165}
}
MLA
Cite this
MLA Copy
Vizing, V.G.. “On incidentor coloring in a hypergraph.” Journal of Applied and Industrial Mathematics, vol. 3, no. 1, Jan. 2009, pp. 144-147. https://doi.org/10.1134/s1990478909010165.