emeryt
Wydział Matematyki Stosowanej WMS-kmd, Katedra Matematyki Dyskretnej
ORCID: brak
ResearcherID: brak
Scopus: brak
OPI Nauka Polska
'3in1' Enchanced: three squared ways to '3in1' GRAPHS / Zdzisław SKUPIEŃ // Discussiones Mathematicae. Graph Theory ; ISSN 1234-3099. — 2007 vol. 27 no. 3, s. 561–563. — Bibliogr. s. 563. — Proceedings of the 14th Workshop '3in1' GRAPHS 2005 : Dobczyce, November 10-12, 2005 / International Visegrad Fund. — Zielona Góra : Technical University Press, 2007. — tekst: http://goo.gl/LvdprW
A partial refining of the Erdös-Kelly regulation / Joanna GÓRSKA, Zdzisław SKUPIEŃ // Opuscula Mathematica ; ISSN 1232-9274. — Tytuł poprz.: Scientific Bulletins of Stanisław Staszic Academy of Mining and Metallurgy. Opuscula Mathematica. — 2019 vol. 39 no. 3, s. 355–360. — Bibliogr. s. 359–360, Abstr.. — Publikacja dostępna online od: 2019-02-23. — tekst: https://www.opuscula.agh.edu.pl/vol39/3/art/opuscula_math_3921.pdf
A Sokoban-type game and arc deletion within irregular digraphs of all sizes / Zyta Dziechcińska-Halamoda, Zofia Majcher, Jerzy Michael, Zdzisław SKUPIEŃ // Discussiones Mathematicae. Graph Theory ; ISSN 1234-3099. — 2007 vol. 27 iss. 3, s. 611–622. — Bibliogr. s. 622, Abstr.. — 14th Workshop '3in1' GRAPHS 2005 : Dobczyce, November 10-12, 2005. — tekst: https://goo.gl/qkH4RM
BCH codes and distance multi-or fractional colorings in hypercubes asymptotically / Zdzisław SKUPIEŃ // Discrete Mathematics ; ISSN 0012-365X. — 2007 vol. 307 iss. 7–8, s. 990–1000. — Bibliogr. s. 999–1000, Abstr.. — Publikacja dostępna online od: 2006-09-25. — 12th Cycles and colourings 2003 workshop : Stara Lesna, Slovakia, August 31–September 05, 2003. — tekst: https://goo.gl/kfVh9I
Counting maximal distance-independent sets in grid graphs / Reinhardt Euler, Paweł OLEKSIK, Zdzisław SKUPIEŃ // Discussiones Mathematicae. Graph Theory ; ISSN 1234-3099. — 2013 vol. 33 no. 3, s. 531–557. — Bibliogr. s. 557, Abstr.
Decompositions of a complete multidigraph into almost arbitrary paths / Mariusz MESZKA, Zdzisław SKUPIEŃ // Discussiones Mathematicae. Graph Theory ; ISSN 1234-3099. — 2012 vol. 32 iss. 2, s. 357–372. — Bibliogr. s. 371–372, Abstr.
Decompositions of nearly complete digraphs into \emph {t} isomorphic parts / Mariusz MESZKA, Zdzisław SKUPIEŃ // Discussiones Mathematicae. Graph Theory ; ISSN 1234-3099. — 2009 vol. 29 iss. 3, s. 563–572. — Bibliogr. s. 571–572. — tekst: http://web.a.ebscohost.com/ehost/viewarticle?data=dGJyMPPp44rp2%2fdV0%2bnjisfk5Ie46bRRtq6vTq6k63nn5Kx95uXxjL6rrUytqK5Js5avSLirr1Kypp5Zy5zyit%2fk8Xnh6ueH7N%2fiVa%2bqtU23ra9Nta2khN%2fk5VXu4qR84LPfUeac8nnls79mpNfsVbKvrk%2bxrrVOpNztiuvX8lXu2uRe8%2bLqbOPu8gAA&hid=4209
Erratum to “Inducing regularization of graphs, multigraphs and pseudographs” [Ars Combin. 65 (2002) 129–133] / Joanna GÓRSKA, Zdzisław SKUPIEŃ // Ars Combinatoria ; ISSN 0381-7032. — 2007 vol. 82, s. 381–382. — Bibliogr. s. 382
Exponentially many hypohamiltonian snarks / Zdzisław SKUPIEŃ // Electronic Notes in Discrete Mathematics ; ISSN 1571-0653. — 2007 vol. 28, s. 417–424. — Bibliogr. s. 423–424, Abstr.. — Publikacja dostępna online od: 2007-03-02. — 6th Czech-Slovak international symposium on Combinatorics, graph theory, algorithms and applications : Prague, Czech Republic, 10–16 July 2006. — tekst: https://goo.gl/wP78Wx
Extremal irregular digraphs / Joanna GÓRSKA, Zdzisław SKUPIEŃ, Zyta Dziechcińska-Halamoda, Zofia Majcher, Jerzy Michael // Discussiones Mathematicae. Graph Theory ; ISSN 1234-3099. — 2018 vol. 38 iss. 3, s. 791–800. — Bibliogr. s. 799–800. — tekst: http://www.discuss.wmie.uz.zgora.pl/php/discuss3.php?ip=&url=pdf&nIdA=25514&nIdSesji=-1
Inducing regulation of any digraphs / Joanna GÓRSKA, Zdzisław SKUPIEŃ // Discrete Applied Mathematics ; ISSN 0166-218X. — 2009 vol. 157 iss. 5, s. 947–952. — Bibliogr. s. 952, Abstr.. — tekst: http://www.sciencedirect.com/science/article/pii/S0166218X08001480/pdfft?md5=7c279aa9380c70d68c8e8d55500f1910&pid=1-s2.0-S0166218X08001480-main.pdf
Majorization and the minimum number of dominating sets / Zdzisław SKUPIEŃ // Discrete Applied Mathematics ; ISSN 0166-218X. — 2014 vol. 165 spec. iss., s. 295–302. — Bibliogr. s. 301–302, Abstr.. — Częściowe wyniki artykułu były prezentowane także: C&C 2011, Smokovce (Slovakia), Sept. 4–9 ; CID 2011, Szklarska Poręba (Poland), Sept. 18–23 ; 3in1 GRAPHS, Krynica (Poland), Nov. 24–26, 2011. — tekst: http://www.sciencedirect.com/science/article/pii/S0166218X13002254/pdfft?md5=6a052a79276fee805632ee018dbe5b7c&pid=1-s2.0-S0166218X13002254-main.pdf
Maximizing hamiltonian pairs and \emph{k}-sets via numerous leaves in a tree / Artur FORTUNA, Zdzisław SKUPIEŃ, Andrzej ŻAK // Discrete Mathematics ; ISSN 0012-365X. — 2009 vol. 309 iss. 6, s. 1788-1792. — Bibliogr. s. 1792, Abstr.. — tekst: http://www.sciencedirect.com/science/article/pii/S0012365X08001726/pdfft?md5=a47fbd45a5696a831480676670dbb310&pid=1-s2.0-S0012365X08001726-main.pdf
Multi-compositions in exponential counting of hypohamiltonian snarks / Zdzisław SKUPIEŃ // W: Convexity and discrete geometry including graph theory : Mulhouse, France, September 2014 / eds. Karim Adiprasito, Imre Bárány, Costin Vîlcu. — Switzerland : Springer International Publishing, cop. 2016. — (Springer Proceedings in Mathematics & Statistics ; ISSN 2194-1009 ; vol. 148). — ISBN: 978-3-319-28184-1 ; e-ISBN: 978-3-319-28186-5. — S. 47–58. — Bibliogr. s. 57–58
On cycle lengths in claw-free graphs with complete closure / Zdeněk Ryjáček, Zdzisław SKUPIEŃ, Petr Vrána // Discrete Mathematics ; ISSN 0012-365X. — 2010 vol. 310 iss. 3, s. 570–574. — Bibliogr. s. 574, Abstr.. — Sixth Czech-Slovak international symposium on Combinatorics, graph theory, algorithms and applications, Prague, July 10–15, 2006. — tekst: http://www.sciencedirect.com/science/article/pii/S0012365X0900168X/pdfft?md5=c44f6b2f821faaa3c4cb828e3598cfe2&pid=1-s2.0-S0012365X0900168X-main.pdf
On detour homogeneous digraphs / Susan van Aardt, Frank Bullock, Joanna GÓRSKA, Zdzisław SKUPIEŃ // Discrete Mathematics ; ISSN 0012-365X. — 2009 vol. 309, s. 6415–6424. — Bibliogr. s. 6424, Abstr.. — 5th Cracow Conference on Graphy Theory : Ustron, SEP 11-15, 2006-2009
On extremal sizes of locally \emph {k}-tree graphs / Mieczysław Borowiecki, Piotr Borowiecki, Elżbieta Sidorowicz, Zdzisław SKUPIEŃ // Czechoslovak Mathematical Journal ; ISSN 0011-4642. — 2010 vol. 60 iss. 2, s. 571–587. — Bibliogr. s. 586–587, Abstr.. — tekst: http://link.springer.com/content/pdf/10.1007%2Fs10587-010-0037-z.pdf
Pairs of trees in tree-tree triangulations / Günter Schaar, Zdzisław SKUPIEŃ // Discrete Mathematics ; ISSN 0012-365X. — 2007 vol. 307 iss. 11–12, s. 1499–1505. — Bibliogr. s. 1505, Abstr.. — The fourth Caracow conference on graph theory : Czorsztyn, Poland 16–20 September 2002. — tekst: https://goo.gl/cWzveh
Pair-sums packing and rainbow cliques / Zdzisław SKUPIEŃ, Andrzej ŻAK // W: Topics in graph theory [Dokument elektroniczny] / ed. Regina Tyshkevich. — Wersja do Windows. — Dane tekstowe. — [USA] : University of Illinois, 2013. — Tryb dostępu: http://www.math.uiuc.edu./ kostochk/Zykov90-Topics_in_Graph_Theory.pdf. — S. 131–144. — Wymagania systemowe: Adobe Reader. — Bibliogr. s. 143–144
Rainbow regular order of graphs / Zdzisław SKUPIEŃ, Andrzej ŻAK // Australasian Journal of Combinatorics ; ISSN 1034-4942. — 2008 vol. 42, s. 115–127. — Bibliogr. s. 126–127, Abstr.. — tekst: http://ajc-1maths-1uq-1edu-1au-1atoz.wbg2.bg.agh.edu.pl/pdf/42/ajc_v42_p115.pdf
Recurrence among trees with most numerous efficient dominating sets / Dorota Bród, Zdzisław SKUPIEŃ // Discrete Mathematics and Theoretical Computer Science ; ISSN 1462-7264. — 2008 vol. 10 iss. 1, s. 43–55. — Bibliogr. s. 55. — tekst: http://web.ebscohost.com/ehost/pdfviewer/pdfviewer?vid=3&sid=0954af78-ece0-4003-9b76-529f97314dfe%40sessionmgr11&hid=18
Sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles / Zdzisław SKUPIEŃ // Discrete Mathematics ; ISSN 0012-365X. — 2009 vol. 309 iss. 22, s. 6382–6390. — Bibliogr. s. 6390, Abstr.. — Fifth Cracow Conference on Graph Theory “Ustron 2006” : Ustroń, September 11 to 15, 2006. — tekst: http://www-1sciencedirect-1com-1sciencecitationindex.wbg2.bg.agh.edu.pl/science/article/pii/S0012365X08006341/pdfft?md5=3f3f5538f03f7d0028e3407b34187706&pid=1-s2.0-S0012365X08006341-main.pdf
Sums of powered characteristic roots count distance-independent circular sets / Zdzisław SKUPIEŃ // Discussiones Mathematicae. Graph Theory ; ISSN 1234-3099. — 2013 vol. 33 no. 1, s. 217–229. — Bibliogr. s. 228–229, Abstr.. — tekst: http://web.ebscohost.com/ehost/pdfviewer/pdfviewer?sid=7b477346-5193-4011-9722-f6f3bc229519%40sessionmgr12&vid=2&hid=14
The Petersen and Heawood graphs make up graphical twins via induced matchings / Zdzisław SKUPIEŃ // Discussiones Mathematicae. Graph Theory ; ISSN 1234-3099. — 2023 vol. 43 no. 3, s. 677–683. — Bibliogr. s. 682–683, Abstr.. — Publikacja dostępna online od: 2021-02-21. — tekst: https://www.dmgt.uz.zgora.pl/publish/pdf.php?doi=2394
Trees with maximum number of maximal matchings / Joanna GÓRSKA, Zdzisław SKUPIEŃ // Discrete Mathematics ; ISSN 0012-365X. — 2007 vol. 307 iss. 11–12, s. 1367–1377. — Bibliogr. s. 1376–1377, Abstr.. — 4th Cracow conference on graph theory : September 16-20, 2002, Czorsztyn, Poland. — tekst: https://goo.gl/h9c36Y