Zobrazeno 1 - 10
of 69
pro vyhledávání: '"Mihók, Peter"'
Publikováno v:
Ekonomika a spoločnosť / Journal of Economics and Social Research. 23(2):56-84
Externí odkaz:
https://www.ceeol.com/search/article-detail?id=1096432
Autor:
Mihók, Peter
Publikováno v:
Ekonomika a spoločnosť / Journal of Economics and Social Research. 22(1):55-76
Externí odkaz:
https://www.ceeol.com/search/article-detail?id=964956
We show that additive induced-hereditary properties of coloured hypergraphs can be uniquely factorised into irreducible factors. Our constructions and proofs are so general that they can be used for arbitrary concrete categories of combinatorial obje
Externí odkaz:
http://arxiv.org/abs/math/0306166
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 35, Iss 3, Pp 517-532 (2015)
Let P and Q be additive and hereditary graph properties, r, s ∈ N, r ≥ s, and [ℤr]s be the set of all s-element subsets of ℤr. An (r, s)-fractional (P,Q)-total coloring of G is an assignment h : V (G) ∪ E(G) → [ℤr]s such that for each i
Externí odkaz:
https://doaj.org/article/6018a8055cd54585a87741f82d697efd
Autor:
Mihók, Peter
Publikováno v:
Perspectives of Innovations, Economics and Business, PIEB. 14(4):175-183
Externí odkaz:
https://www.ceeol.com/search/article-detail?id=440924
Autor:
Czap Július, Mihók Peter
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 33, Iss 3, Pp 509-519 (2013)
An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphism. Let be an additive hereditary property of graphs. A -edge-coloring of a simple graph is an edge coloring in which the edges
Externí odkaz:
https://doaj.org/article/dcf06140f4b34e12ab38fa3b7cd65fc0
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 33, Iss 3, Pp 477-492 (2013)
Rado constructed a (simple) denumerable graph R with the positive integers as vertex set with the following edges: For given m and n with m < n, m is adjacent to n if n has a 1 in the m’th position of its binary expansion. It is well known that R i
Externí odkaz:
https://doaj.org/article/ebf3bffa3d424f1782a5bd9f5a3a286f
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 33, Iss 1, Pp 167-179 (2013)
Let r, s ∈ N, r ≥ s, and P and Q be two additive and hereditary graph properties. A (P,Q)-total (r, s)-coloring of a graph G = (V,E) is a coloring of the vertices and edges of G by s-element subsets of Zr such that for each color i, 0 ≤ i ≤ r
Externí odkaz:
https://doaj.org/article/704be424c10d45d396fb8f1241011be8
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Discrete Mathematics 2007 307(7):916-922