A. Pawel Wojda

According to our database, A. Pawel Wojda authored at least 45 papers between 1981 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2023

Extending Poto?nik and ?ajna's conditions on the existence of vertex-transitive self-complementary k-hypergraphs.

Linda M. Lesniak, Henri Thuiller, Adam Pawel Wojda

Discuss. Math. Graph Theory, 2023

2018

Almost self-complementary uniform hypergraphs.

Adam Pawel Wojda

Discuss. Math. Graph Theory, 2018

2013

Cyclic partitions of complete nonuniform hypergraphs and complete multipartite hypergraphs.

Shonda Gosselin, Artur Szymanski, Adam Pawel Wojda

Discret. Math. Theor. Comput. Sci., 2013

On minimum (<i>K_q, k</i>) stable graphs.

Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, Adam Pawel Wojda

Discuss. Math. Graph Theory, 2013

2012

On (K_q, k) vertex stable graphs with minimum size.

Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, A. Pawel Wojda

Discret. Math., 2012

On (K_q, k) Stable Graphs with Small k.

Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, Adam Pawel Wojda

Electron. J. Comb., 2012

2010

Preface.

A. Pawel Wojda

Discuss. Math. Graph Theory, 2010

Cyclic Partitions of Complete Uniform Hypergraphs.

Artur Szymanski, A. Pawel Wojda

Electron. J. Comb., 2010

2009

A note on t-complementing permutations for graphs.

Lech Adamus, Beata Orchel, Artur Szymanski, A. Pawel Wojda, Malgorzata Zwonek

Inf. Process. Lett., 2009

Self-complementing permutations of k-uniform hypergraphs.

Artur Szymanski, A. Pawel Wojda

Discret. Math. Theor. Comput. Sci., 2009

A note on <i>k</i>-uniform self-complementary hypergraphs of given order.

Artur Szymanski, A. Pawel Wojda

Discuss. Math. Graph Theory, 2009

On odd and semi-odd linear partitions of cubic graphs.

Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, A. Pawel Wojda

Discuss. Math. Graph Theory, 2009

2008

Independent cycles and paths in bipartite balanced graphs.

Beata Orchel, A. Pawel Wojda

Discuss. Math. Graph Theory, 2008

2007

Bipartite graphs with every matching in a cycle.

Denise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz, A. Pawel Wojda

Discret. Math., 2007

On Self-Complementary Cyclic Packing of Forests.

A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo

Electron. J. Comb., 2007

2006

Almost Symmetric Cycles in Large Digraphs.

Lech Adamus, A. Pawel Wojda

Graphs Comb., 2006

Self-complementary hypergraphs and their self-complementing permutations.

Artur Szymanski, A. Pawel Wojda

Electron. Notes Discret. Math., 2006

Some results on placing bipartite graphs of maximum degree two.

Beata Orchel, A. Pawel Wojda

Electron. Notes Discret. Math., 2006

On isomorphic linear partitions in cubic graphs.

Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, A. Pawel Wojda

Electron. Notes Discret. Math., 2006

Self-complementary hypergraphs.

A. Pawel Wojda

Discuss. Math. Graph Theory, 2006

Hamiltonian path saturated graphs with small size.

Aneta Dudek, Gyula Y. Katona, A. Pawel Wojda

Discret. Appl. Math., 2006

2005

Erratum to "On self-complementary supergraphs of (<i>n</i>, <i>n</i>)-graphs" [Discrete Math. 292(2005) 167-185].

A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo

Discret. Math., 2005

On self-complementary supergraphs of (<i>n, n</i>)-graphs.

A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo

Discret. Math., 2005

2004

P_m-saturated bipartite graphs with minimum size.

Aneta Dudek, Adam Pawel Wojda

Discuss. Math. Graph Theory, 2004

A condition for a graph to contain <i>k</i>-matching.

A. Pawel Wojda

Discret. Math., 2004

2003

m_Path Cover Saturated Graphs.

Aneta Dudek, Gyula Y. Katona, A. Pawel Wojda

Electron. Notes Discret. Math., 2003

2001

Preface.

Rafal Kalinowski, Antoni Marczyk, Mariusz Meszka, A. Pawel Wojda

Discret. Math., 2001

2000

On self-complementary supergraphs of (n, n)-graphs.

A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo

Electron. Notes Discret. Math., 2000

A note on the colour class of a self-complementary graph.

A. Pawel Wojda

Discret. Math., 2000

Graphs with every <i>k</i>-matching in a Hamiltonian cycle.

Grzegorz Gancarzewicz, A. Pawel Wojda

Discret. Math., 2000

1999

Erdös-type condition for a graph to contain k independent edges.

A. Pawel Wojda

Electron. Notes Discret. Math., 1999

1997

Embedding digraphs of small size.

A. Pawel Wojda, Irmina A. Ziolo

Discret. Math., 1997

Packing bipartite graphs.

A. Pawel Wojda, Paul Vaderlind

Discret. Math., 1997

An upper bound for the Hamiltonicity exponent of finite digraphs.

Günter Schaar, A. Pawel Wojda

Discret. Math., 1997

Preface.

Anna Rycerz, A. Pawel Wojda, Mariusz Wozniak

Discret. Math., 1997

Coloring Edges of Self-complementary Graphs.

A. Pawel Wojda, Malgorzata Zwonek

Discret. Appl. Math., 1997

1993

Triple placement of graphs.

Mariusz Wozniak, A. Pawel Wojda

Graphs Comb., 1993

Mutual placement of bipartite graphs.

Jean-Luc Fouquet, A. Pawel Wojda

Discret. Math., 1993

Graphs with every matching contained in a cycle.

Abdelhamid Benhocine, A. Pawel Wojda

Discret. Math., 1993

1987

The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs.

Abdelhamid Benhocine, A. Pawel Wojda

J. Comb. Theory B, 1987

1986

Orientations of hamiltonian cycles in large digraphs.

Adam Pawel Wojda

J. Graph Theory, 1986

Digraphs without directed path of length two or three.

Dominique Sotteau, A. Pawel Wojda

Discret. Math., 1986

1985

On self-complementation.

Abdelhamid Benhocine, A. Pawel Wojda

J. Graph Theory, 1985

1983

On the existence of specified cycles in a tournament.

Abdelhamid Benhocine, A. Pawel Wojda

J. Graph Theory, 1983

1981

Meyniel's theorem for strongly (<i>p, q</i>) - Hamiltonian digraphs.

A. Pawel Wojda

J. Graph Theory, 1981