A. Pawel Wojda

39 papers Journal 39
YearRankTypeTitle / Venue / Authors
2012 J jnl
On (K
Discret. Math.
Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, A. Pawel Wojda
2010 J jnl
Cyclic Partitions of Complete Uniform Hypergraphs.
Electron. J. Comb.
Artur Szymanski, A. Pawel Wojda
2010 J jnl
Preface.
Discuss. Math. Graph Theory
A. Pawel Wojda
2009 J jnl
A note on
Discuss. Math. Graph Theory
Artur Szymanski, A. Pawel Wojda
2009 J jnl
A note on t-complementing permutations for graphs.
Inf. Process. Lett.
Lech Adamus, Beata Orchel, Artur Szymanski, A. Pawel Wojda, Malgorzata Zwonek
2009 J jnl
On isomorphic linear partitions in cubic graphs.
Discret. Math.
Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, A. Pawel Wojda
2009 J jnl
On odd and semi-odd linear partitions of cubic graphs.
Discuss. Math. Graph Theory
Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, A. Pawel Wojda
2009 J jnl
Self-complementing permutations of k-uniform hypergraphs.
Discret. Math. Theor. Comput. Sci.
Artur Szymanski, A. Pawel Wojda
2008 J jnl
Independent cycles and paths in bipartite balanced graphs.
Discuss. Math. Graph Theory
Beata Orchel, A. Pawel Wojda
2007 J jnl
Bipartite graphs with every matching in a cycle.
Discret. Math.
Denise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz, A. Pawel Wojda
2007 J jnl
On Self-Complementary Cyclic Packing of Forests.
Electron. J. Comb.
A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo
2006 J jnl
Almost Symmetric Cycles in Large Digraphs.
Graphs Comb.
Lech Adamus, A. Pawel Wojda
2006 J jnl
Hamiltonian path saturated graphs with small size.
Discret. Appl. Math.
Aneta Dudek, Gyula Y. Katona, A. Pawel Wojda
2006 J jnl
On isomorphic linear partitions in cubic graphs.
Electron. Notes Discret. Math.
Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, A. Pawel Wojda
2006 J jnl
Self-complementary hypergraphs and their self-complementing permutations.
Electron. Notes Discret. Math.
Artur Szymanski, A. Pawel Wojda
2006 J jnl
Self-complementary hypergraphs.
Discuss. Math. Graph Theory
A. Pawel Wojda
2006 J jnl
Some results on placing bipartite graphs of maximum degree two.
Electron. Notes Discret. Math.
Beata Orchel, A. Pawel Wojda
2005 J jnl
Erratum to "On self-complementary supergraphs of (
Discret. Math.
A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo
2005 J jnl
On self-complementary supergraphs of (
Discret. Math.
A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo
2004 J jnl
A condition for a graph to contain
Discret. Math.
A. Pawel Wojda
2003 J jnl
m_Path Cover Saturated Graphs.
Electron. Notes Discret. Math.
Aneta Dudek, Gyula Y. Katona, A. Pawel Wojda
2001 J jnl
Preface.
Discret. Math.
Rafal Kalinowski, Antoni Marczyk, Mariusz Meszka, A. Pawel Wojda
2000 J jnl
A note on the colour class of a self-complementary graph.
Discret. Math.
A. Pawel Wojda
2000 J jnl
Graphs with every
Discret. Math.
Grzegorz Gancarzewicz, A. Pawel Wojda
2000 J jnl
On self-complementary supergraphs of (n, n)-graphs.
Electron. Notes Discret. Math.
A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo
1999 J jnl
Erdös-type condition for a graph to contain k independent edges.
Electron. Notes Discret. Math.
A. Pawel Wojda
1997 J jnl
An upper bound for the Hamiltonicity exponent of finite digraphs.
Discret. Math.
Günter Schaar, A. Pawel Wojda
1997 J jnl
Coloring Edges of Self-complementary Graphs.
Discret. Appl. Math.
A. Pawel Wojda, Malgorzata Zwonek
1997 J jnl
Embedding digraphs of small size.
Discret. Math.
A. Pawel Wojda, Irmina A. Ziolo
1997 J jnl
Packing bipartite graphs.
Discret. Math.
A. Pawel Wojda, Paul Vaderlind
1997 J jnl
Preface.
Discret. Math.
Anna Rycerz, A. Pawel Wojda, Mariusz Wozniak
1993 J jnl
Graphs with every matching contained in a cycle.
Discret. Math.
Abdelhamid Benhocine, A. Pawel Wojda
1993 J jnl
Mutual placement of bipartite graphs.
Discret. Math.
Jean-Luc Fouquet, A. Pawel Wojda
1993 J jnl
Triple placement of graphs.
Graphs Comb.
Mariusz Wozniak, A. Pawel Wojda
1987 J jnl
The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs.
J. Comb. Theory B
Abdelhamid Benhocine, A. Pawel Wojda
1986 J jnl
Digraphs without directed path of length two or three.
Discret. Math.
Dominique Sotteau, A. Pawel Wojda
1985 J jnl
On self-complementation.
J. Graph Theory
Abdelhamid Benhocine, A. Pawel Wojda
1983 J jnl
On the existence of specified cycles in a tournament.
J. Graph Theory
Abdelhamid Benhocine, A. Pawel Wojda
1981 J jnl
Meyniel's theorem for strongly (
J. Graph Theory
A. Pawel Wojda