Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Jerzy Michael"'
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 38, Iss 3, Pp 791-800 (2018)
A digraph is called irregular if its distinct vertices have distinct degree pairs. An irregular digraph is called minimal (maximal) if the removal of any arc (addition of any new arc) results in a non-irregular digraph. It is easily seen that the min
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bed91763f39c1a1db628c94ba4598f0e
https://doaj.org/article/e88e4b657b99401db8d1a54e8eb53fe1
https://doaj.org/article/e88e4b657b99401db8d1a54e8eb53fe1
Publikováno v:
Discrete Mathematics. 339(1):95-102
The type t G ( v ) of a vertex v ? V ( G ) is the ordered degree-sequence ( d 1 , ? , d d G ( v ) ) of the vertices adjacent with v , where d 1 ? ? ? d d G ( v ) . A graph G is called vertex-oblique if it contains no two vertices of the same type. In
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e0c9c3f812b647f292b6a14c61f211af
https://doi.org/10.1016/j.disc.2015.07.012
https://doi.org/10.1016/j.disc.2015.07.012
Publikováno v:
Discrete Mathematics. 286(1-2):79-88
A digraph is called irregular if its vertices have mutually distinct ordered pairs of semi-degrees. Let D be any diregular oriented graph (without loops or 2-dicycles). A smallest irregular oriented graph F, F=F(D), is constructed such that F include
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b499e9efd6a676ad632fe5bdfc14f56e
Publikováno v:
Archiv der Mathematik. 69:254-258
Games without repetitions on graphs with vertex disjoint cycles are considered. We show that the problem finding of the game partition in this class reduces to this problem for trees. A method of finding of the game partition for trees have been give
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94d42aca0026bd34c3c539ca097facaa
https://doi.org/10.1007/s000130050118
https://doi.org/10.1007/s000130050118
Autor:
Jerzy Michael, Zofia Majcher
Publikováno v:
Discrete Mathematics. 164:237-242
A simple connected graph is highly irregular if each of its vertices is adjacent only to vertices with distinct degrees. In this paper we find: (1) the greatest number of edges of a highly irregular graph with n vertices, where n is an odd integer (f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7984c15c743bb8a063a494b1752ae6d9
https://doi.org/10.1016/s0012-365x(96)00056-8
https://doi.org/10.1016/s0012-365x(96)00056-8
Publikováno v:
Archiv der Mathematik. 61:395-400
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::146106c6142ca2625bc9fc68a712302b
https://doi.org/10.1007/bf01201457
https://doi.org/10.1007/bf01201457
Publikováno v:
Archiv der Mathematik. 59:603-609
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b2e4852a6dc2d1528fefa2e169a9bb12
https://doi.org/10.1007/bf01194854
https://doi.org/10.1007/bf01194854
Publikováno v:
Discussiones Mathematicae Graph Theory. 27:611
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f824ad559cee057f28092671fa5d5dc
https://doi.org/10.7151/dmgt.1387
https://doi.org/10.7151/dmgt.1387
Publikováno v:
Discussiones Mathematicae Graph Theory. 26:317
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::372f343145e9ee07b1a4a9f0dc94a010
https://doi.org/10.7151/dmgt.1323
https://doi.org/10.7151/dmgt.1323
Autor:
Jerzy Michael, Zofia Majcher
Publikováno v:
Discussiones Mathematicae Graph Theory. 18:49
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::40de4cafa662b2b6d0e27d545575f1c1
https://doi.org/10.7151/dmgt.1062
https://doi.org/10.7151/dmgt.1062