Zobrazeno 1 - 10
of 65
pro vyhledávání: '"Zdzisław Skupień"'
Autor:
Zdzisław Skupień
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 43, Iss 3, p 677 (2023)
Externí odkaz:
https://doaj.org/article/f99983da0a42400eb74c71fb000f247d
Autor:
Joanna Górska, Zdzisław Skupień
Publikováno v:
Opuscula Mathematica, Vol 39, Iss 3, Pp 355-360 (2019)
The aim of this note is to advance the refining of the Erdős-Kelly result on graphical inducing regularization. The operation of inducing regulation (on graphs or multigraphs) with prescribed maximum vertex degree is originated by D. König in 1916.
Externí odkaz:
https://doaj.org/article/ede285ba8b3d4ba786450723451155eb
Autor:
Artur Fortuna, Zdzisław Skupień
Publikováno v:
Opuscula Mathematica, Vol 33, Iss 4, Pp 685-696 (2013)
It is shown that there is no digraph \(F\) which could decompose the complete digraph on 5 vertices minus any 2-arc remainder into three parts isomorphic to \(F\) for each choice of the remainder. On the other hand, for each \(n\ge3\) there is a univ
Externí odkaz:
https://doaj.org/article/cb2060dad4ee4520be299905259abde7
Publikováno v:
Opuscula Mathematica, Vol 24, Iss 1, Pp 97-102 (2004)
We establish the computational time complexity of the existence problem of a decomposition of an instance multigraph into isomorphic 3-vertex paths with multiple edges. If the two edge multiplicities are distinct, the problem is NPC; if mutually equa
Externí odkaz:
https://doaj.org/article/79fa654fd8424c30be1c08a0feadcea2
Autor:
Dorota Bród, Zdzisław Skupień
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 10 no. 1, Iss Graph and Algorithms (2008)
Graphs and Algorithms
Externí odkaz:
https://doaj.org/article/d73dbdb704b2459f9aa414b5ed9aeac6
Autor:
Zdzisław Skupień, Joanna Górska
Publikováno v:
Opuscula Mathematica, Vol 39, Iss 3, Pp 355-360 (2019)
The aim of this note is to advance the refining of the Erdős-Kelly result on graphical inducing regularization. The operation of inducing regulation (on graphs or multigraphs) with prescribed maximum vertex degree is originated by D. König in 1916.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::608215b7e43e29a5fa9049a3bffe0b17
https://www.opuscula.agh.edu.pl/vol39/3/art/opuscula_math_3921.pdf
https://www.opuscula.agh.edu.pl/vol39/3/art/opuscula_math_3921.pdf
Autor:
Zdzisław Skupień
Publikováno v:
Discussiones Mathematicae Graph Theory.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5df1f32b0e2d2317db0c7cf3e8b3b7b2
https://doi.org/10.7151/dmgt.2394
https://doi.org/10.7151/dmgt.2394
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
Autor:
Zdzisław Skupień
Publikováno v:
Commentationes Mathematicae. 11
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28e23b2ebf3a6ec4576d1e76f0275c6c
https://doi.org/10.14708/cm.v11i1.5622
https://doi.org/10.14708/cm.v11i1.5622
Autor:
Zdzisław Skupień
Publikováno v:
Wiadomości Matematyczne. 39
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e8ce3a9240ce74acaad75914e49e034
https://doi.org/10.14708/wm.v39i01.4944
https://doi.org/10.14708/wm.v39i01.4944