A. Pawel Wojda - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 39 from 39

2012

q, k) vertex stable graphs with minimum sizeJean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, A. Pawel Wojda. DM, 312(14):2109-2118, 2012. [doi]

2010

Cyclic Partitions of Complete Uniform HypergraphsArtur Szymanski, A. Pawel Wojda. combinatorics, 17(1), 2010. [doi]

PrefaceA. Pawel Wojda. dmgt, 30(2):275-276, 2010. [doi]

2009

A note on t-complementing permutations for graphsLech Adamus, Beata Orchel, Artur Szymanski, A. Pawel Wojda, Malgorzata Zwonek. ipl, 110(2):44-45, 2009. [doi]

On isomorphic linear partitions in cubic graphsJean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, A. Pawel Wojda. DM, 309(22):6425-6433, 2009. [doi]

On odd and semi-odd linear partitions of cubic graphsJean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, A. Pawel Wojda. dmgt, 29(2):275-292, 2009. [doi]

Self-complementing permutations of k-uniform hypergraphsArtur Szymanski, A. Pawel Wojda. dmtcs, 11(1):117-124, 2009. [doi]

A note on ::::k::::-uniform self-complementary hypergraphs of given orderArtur Szymanski, A. Pawel Wojda. dmgt, 29(1):199-202, 2009. [doi]

2008

Independent cycles and paths in bipartite balanced graphsBeata Orchel, A. Pawel Wojda. dmgt, 28(3):535-549, 2008. [doi]

2007

Bipartite graphs with every matching in a cycleDenise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz, A. Pawel Wojda. DM, 307(11-12):1525-1537, 2007. [doi]

On Self-Complementary Cyclic Packing of ForestsA. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo. combinatorics, 14(1), 2007. [doi]

2006

Almost Symmetric Cycles in Large DigraphsLech Adamus, A. Pawel Wojda. gc, 22(4):443-452, 2006. [doi]

Hamiltonian path saturated graphs with small sizeAneta Dudek, Gyula Y. Katona, A. Pawel Wojda. DAM, 154(9):1372-1379, 2006. [doi]

On isomorphic linear partitions in cubic graphsJean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, A. Pawel Wojda. endm, 24:277-284, 2006. [doi]

Some results on placing bipartite graphs of maximum degree twoBeata Orchel, A. Pawel Wojda. endm, 24:285-289, 2006. [doi]

Self-complementary hypergraphs and their self-complementing permutationsArtur Szymanski, A. Pawel Wojda. endm, 24:291-294, 2006. [doi]

Self-complementary hypergraphsA. Pawel Wojda. dmgt, 26(2):217-224, 2006. [doi]

2005

Erratum to On self-complementary supergraphs of (::::n::::, ::::n::::)-graphs [Discrete Math. 292(2005) 167-185]A. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo. DM, 301(2-3):247, 2005. [doi]

On self-complementary supergraphs of (::::n, n::::)-graphsA. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo. DM, 292(1-3):167-185, 2005. [doi]

2004

A condition for a graph to contain ::::k::::-matchingA. Pawel Wojda. DM, 276(1-3):375-378, 2004. [doi]

2003

m_Path Cover Saturated GraphsAneta Dudek, Gyula Y. Katona, A. Pawel Wojda. endm, 13:41-44, 2003. [doi]

2001

PrefaceRafal Kalinowski, Antoni Marczyk, Mariusz Meszka, A. Pawel Wojda. DM, 236(1-3):1, 2001. [doi]

2000

Graphs with every ::::k::::-matching in a Hamiltonian cycleGrzegorz Gancarzewicz, A. Pawel Wojda. DM, 213(1-3):141-151, 2000. [doi]

A note on the colour class of a self-complementary graphA. Pawel Wojda. DM, 213(1-3):333-336, 2000. [doi]

On self-complementary supergraphs of (n, n)-graphsA. Pawel Wojda, Mariusz Wozniak, Irmina A. Ziolo. endm, 5:307-310, 2000. [doi]

1999

Erdös-type condition for a graph to contain k independent edgesA. Pawel Wojda. endm, 3:214-216, 1999. [doi]

1997

PrefaceAnna Rycerz, A. Pawel Wojda, Mariusz Wozniak. DM, 164(1-3):1-4, 1997. [doi]

An upper bound for the Hamiltonicity exponent of finite digraphsGünter Schaar, A. Pawel Wojda. DM, 164(1-3):313-316, 1997. [doi]

Packing bipartite graphsA. Pawel Wojda, Paul Vaderlind. DM, 164(1-3):303-311, 1997. [doi]

Embedding digraphs of small sizeA. Pawel Wojda, Irmina A. Ziolo. DM, 165-166:621-638, 1997. [doi]

Coloring Edges of Self-complementary GraphsA. Pawel Wojda, Malgorzata Zwonek. DAM, 79(1-3):279-284, 1997. [doi]

1993

Graphs with every matching contained in a cycleAbdelhamid Benhocine, A. Pawel Wojda. DM, 118(1-3):11-21, 1993. [doi]

Mutual placement of bipartite graphsJean-Luc Fouquet, A. Pawel Wojda. DM, 121(1-3):85-92, 1993. [doi]

Triple placement of graphsMariusz Wozniak, A. Pawel Wojda. gc, 9(1):85-91, 1993. [doi]

1987

The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphsAbdelhamid Benhocine, A. Pawel Wojda. JCT, 42(2):167-180, 1987. [doi]

1986

Digraphs without directed path of length two or threeDominique Sotteau, A. Pawel Wojda. DM, 58(1):105-108, 1986. [doi]

1985

On self-complementationAbdelhamid Benhocine, A. Pawel Wojda. jgt, 9(3):335-341, 1985. [doi]

1983

On the existence of specified cycles in a tournamentAbdelhamid Benhocine, A. Pawel Wojda. jgt, 7(4):469-473, 1983. [doi]

1981

p, q) - Hamiltonian digraphsA. Pawel Wojda. jgt, 5(3):333-335, 1981. [doi]

Sign in or sign up to see more results.

runs on WebDSL