A. Pawel Wojda

According to our database1, A. Pawel Wojda authored at least 44 papers between 1981 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Almost self-complementary uniform hypergraphs.
Discuss. Math. Graph Theory, 2018

2013
Cyclic partitions of complete nonuniform hypergraphs and complete multipartite hypergraphs.
Discret. Math. Theor. Comput. Sci., 2013

On minimum (<i>K<sub>q</sub>, k</i>) stable graphs.
Discuss. Math. Graph Theory, 2013

2012
On (K<sub>q</sub>, k) vertex stable graphs with minimum size.
Discret. Math., 2012

On (K<sub>q</sub>, k) Stable Graphs with Small k.
Electron. J. Comb., 2012

2010
Preface.
Discuss. Math. Graph Theory, 2010

Cyclic Partitions of Complete Uniform Hypergraphs.
Electron. J. Comb., 2010

2009
A note on t-complementing permutations for graphs.
Inf. Process. Lett., 2009

Self-complementing permutations of k-uniform hypergraphs.
Discret. Math. Theor. Comput. Sci., 2009

A note on <i>k</i>-uniform self-complementary hypergraphs of given order.
Discuss. Math. Graph Theory, 2009

On odd and semi-odd linear partitions of cubic graphs.
Discuss. Math. Graph Theory, 2009

2008
Independent cycles and paths in bipartite balanced graphs.
Discuss. Math. Graph Theory, 2008

2007
Bipartite graphs with every matching in a cycle.
Discret. Math., 2007

On Self-Complementary Cyclic Packing of Forests.
Electron. J. Comb., 2007

2006
Almost Symmetric Cycles in Large Digraphs.
Graphs Comb., 2006

Self-complementary hypergraphs and their self-complementing permutations.
Electron. Notes Discret. Math., 2006

Some results on placing bipartite graphs of maximum degree two.
Electron. Notes Discret. Math., 2006

On isomorphic linear partitions in cubic graphs.
Electron. Notes Discret. Math., 2006

Self-complementary hypergraphs.
Discuss. Math. Graph Theory, 2006

Hamiltonian path saturated graphs with small size.
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].
Discret. Math., 2005

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

2004
P<sub>m</sub>-saturated bipartite graphs with minimum size.
Discuss. Math. Graph Theory, 2004

A condition for a graph to contain <i>k</i>-matching.
Discret. Math., 2004

2003
m_Path Cover Saturated Graphs.
Electron. Notes Discret. Math., 2003

2001
Preface.
Discret. Math., 2001

2000
On self-complementary supergraphs of (n, n)-graphs.
Electron. Notes Discret. Math., 2000

A note on the colour class of a self-complementary graph.
Discret. Math., 2000

Graphs with every <i>k</i>-matching in a Hamiltonian cycle.
Discret. Math., 2000

1999
Erdös-type condition for a graph to contain k independent edges.
Electron. Notes Discret. Math., 1999

1997
Embedding digraphs of small size.
Discret. Math., 1997

Packing bipartite graphs.
Discret. Math., 1997

An upper bound for the Hamiltonicity exponent of finite digraphs.
Discret. Math., 1997

Preface.
Discret. Math., 1997

Coloring Edges of Self-complementary Graphs.
Discret. Appl. Math., 1997

1993
Triple placement of graphs.
Graphs Comb., 1993

Mutual placement of bipartite graphs.
Discret. Math., 1993

Graphs with every matching contained in a cycle.
Discret. Math., 1993

1987
The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs.
J. Comb. Theory, Ser. B, 1987

1986
Orientations of hamiltonian cycles in large digraphs.
J. Graph Theory, 1986

Digraphs without directed path of length two or three.
Discret. Math., 1986

1985
On self-complementation.
J. Graph Theory, 1985

1983
On the existence of specified cycles in a tournament.
J. Graph Theory, 1983

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


  Loading...