default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDA. Pawel Wojda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j46]Linda M. Lesniak, Henri Thuiller, Adam Pawel Wojda:
Extending Poto?nik and ?ajna's conditions on the existence of vertex-transitive self-complementary k-hypergraphs. Discuss. Math. Graph Theory 43(1): 225-231 (2023)
2010 – 2019
- 2018
- [j45]Adam Pawel Wojda:
Almost self-complementary uniform hypergraphs. Discuss. Math. Graph Theory 38(2): 607-610 (2018) - 2013
- [j44]Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, Adam Pawel Wojda:
On minimum (Kq, k) stable graphs. Discuss. Math. Graph Theory 33(1): 101-115 (2013) - [j43]Shonda Gosselin, Artur Szymanski, Adam Pawel Wojda:
Cyclic partitions of complete nonuniform hypergraphs and complete multipartite hypergraphs. Discret. Math. Theor. Comput. Sci. 15(2): 215-222 (2013) - 2012
- [j42]Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, Adam Pawel Wojda:
On (Kq, k) Stable Graphs with Small k. Electron. J. Comb. 19(2): 50 (2012) - [j41]Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, A. Pawel Wojda:
On (Kq, k) vertex stable graphs with minimum size. Discret. Math. 312(14): 2109-2118 (2012) - 2010
- [j40]Artur Szymanski, A. Pawel Wojda:
Cyclic Partitions of Complete Uniform Hypergraphs. Electron. J. Comb. 17(1) (2010) - [j39]A. Pawel Wojda:
Preface. Discuss. Math. Graph Theory 30(2): 275-276 (2010)
2000 – 2009
- 2009
- [j38]Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, A. Pawel Wojda:
On isomorphic linear partitions in cubic graphs. Discret. Math. 309(22): 6425-6433 (2009) - [j37]Artur Szymanski, A. Pawel Wojda:
A note on k-uniform self-complementary hypergraphs of given order. Discuss. Math. Graph Theory 29(1): 199-202 (2009) - [j36]Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, A. Pawel Wojda:
On odd and semi-odd linear partitions of cubic graphs. Discuss. Math. Graph Theory 29(2): 275-292 (2009) - [j35]Artur Szymanski, A. Pawel Wojda:
Self-complementing permutations of k-uniform hypergraphs. Discret. Math. Theor. Comput. Sci. 11(1): 117-124 (2009) - [j34]Lech Adamus, Beata Orchel, Artur Szymanski, A. Pawel Wojda, Malgorzata Zwonek:
A note on t-complementing permutations for graphs. Inf. Process. Lett. 110(2): 44-45 (2009) - 2008
- [j33]Beata Orchel, A. Pawel Wojda:
Independent cycles and paths in bipartite balanced graphs. Discuss. Math. Graph Theory 28(3): 535-549 (2008) - 2007
- [j32]A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo:
On Self-Complementary Cyclic Packing of Forests. Electron. J. Comb. 14(1) (2007) - [j31]Denise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz, A. Pawel Wojda:
Bipartite graphs with every matching in a cycle. Discret. Math. 307(11-12): 1525-1537 (2007) - 2006
- [j30]Aneta Dudek, Gyula Y. Katona
, A. Pawel Wojda:
Hamiltonian path saturated graphs with small size. Discret. Appl. Math. 154(9): 1372-1379 (2006) - [j29]A. Pawel Wojda:
Self-complementary hypergraphs. Discuss. Math. Graph Theory 26(2): 217-224 (2006) - [j28]Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, A. Pawel Wojda:
On isomorphic linear partitions in cubic graphs. Electron. Notes Discret. Math. 24: 277-284 (2006) - [j27]Beata Orchel, A. Pawel Wojda:
Some results on placing bipartite graphs of maximum degree two. Electron. Notes Discret. Math. 24: 285-289 (2006) - [j26]Artur Szymanski, A. Pawel Wojda:
Self-complementary hypergraphs and their self-complementing permutations. Electron. Notes Discret. Math. 24: 291-294 (2006) - [j25]Lech Adamus, A. Pawel Wojda:
Almost Symmetric Cycles in Large Digraphs. Graphs Comb. 22(4): 443-452 (2006) - 2005
- [j24]A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo:
On self-complementary supergraphs of (n, n)-graphs. Discret. Math. 292(1-3): 167-185 (2005) - [j23]A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo:
Erratum to "On self-complementary supergraphs of (n, n)-graphs" [Discrete Math. 292(2005) 167-185]. Discret. Math. 301(2-3): 247 (2005) - 2004
- [j22]A. Pawel Wojda:
A condition for a graph to contain k-matching. Discret. Math. 276(1-3): 375-378 (2004) - [j21]Aneta Dudek, Adam Pawel Wojda:
Pm-saturated bipartite graphs with minimum size. Discuss. Math. Graph Theory 24(2): 197-211 (2004) - 2003
- [j20]Aneta Dudek, Gyula Y. Katona, A. Pawel Wojda:
m_Path Cover Saturated Graphs. Electron. Notes Discret. Math. 13: 41-44 (2003) - 2001
- [j19]Rafal Kalinowski, Antoni Marczyk, Mariusz Meszka, A. Pawel Wojda:
Preface. Discret. Math. 236(1-3): 1- (2001) - 2000
- [j18]Grzegorz Gancarzewicz, A. Pawel Wojda:
Graphs with every k-matching in a Hamiltonian cycle. Discret. Math. 213(1-3): 141-151 (2000) - [j17]A. Pawel Wojda:
A note on the colour class of a self-complementary graph. Discret. Math. 213(1-3): 333-336 (2000) - [j16]A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo:
On self-complementary supergraphs of (n, n)-graphs. Electron. Notes Discret. Math. 5: 307-310 (2000)
1990 – 1999
- 1999
- [j15]A. Pawel Wojda:
Erdös-type condition for a graph to contain k independent edges. Electron. Notes Discret. Math. 3: 214-216 (1999) - 1997
- [j14]A. Pawel Wojda, Malgorzata Zwonek:
Coloring Edges of Self-complementary Graphs. Discret. Appl. Math. 79(1-3): 279-284 (1997) - [j13]Anna Rycerz, A. Pawel Wojda, Mariusz Wozniak:
Preface. Discret. Math. 164(1-3): 1-4 (1997) - [j12]A. Pawel Wojda, Paul Vaderlind:
Packing bipartite graphs. Discret. Math. 164(1-3): 303-311 (1997) - [j11]Günter Schaar, A. Pawel Wojda:
An upper bound for the Hamiltonicity exponent of finite digraphs. Discret. Math. 164(1-3): 313-316 (1997) - [j10]A. Pawel Wojda, Irmina A. Ziolo:
Embedding digraphs of small size. Discret. Math. 165-166: 621-638 (1997) - 1993
- [j9]Abdelhamid Benhocine, A. Pawel Wojda:
Graphs with every matching contained in a cycle. Discret. Math. 118(1-3): 11-21 (1993) - [j8]Jean-Luc Fouquet, A. Pawel Wojda:
Mutual placement of bipartite graphs. Discret. Math. 121(1-3): 85-92 (1993) - [j7]Mariusz Wozniak, A. Pawel Wojda:
Triple placement of graphs. Graphs Comb. 9(1): 85-91 (1993)
1980 – 1989
- 1987
- [j6]Abdelhamid Benhocine, A. Pawel Wojda:
The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs. J. Comb. Theory B 42(2): 167-180 (1987) - 1986
- [j5]Dominique Sotteau, A. Pawel Wojda:
Digraphs without directed path of length two or three. Discret. Math. 58(1): 105-108 (1986) - [j4]Adam Pawel Wojda:
Orientations of hamiltonian cycles in large digraphs. J. Graph Theory 10(2): 211-218 (1986) - 1985
- [j3]Abdelhamid Benhocine, A. Pawel Wojda:
On self-complementation. J. Graph Theory 9(3): 335-341 (1985) - 1983
- [j2]Abdelhamid Benhocine, A. Pawel Wojda:
On the existence of specified cycles in a tournament. J. Graph Theory 7(4): 469-473 (1983) - 1981
- [j1]A. Pawel Wojda:
Meyniel's theorem for strongly (p, q) - Hamiltonian digraphs. J. Graph Theory 5(3): 333-335 (1981)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
