dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Mariusz Wozniak (Selection)

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo


26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJozef Bucko, Peter Mihók, Jean-François Saclé, Mariusz Wozniak: A note on maximal common subgraphs of the Dirac's family of graphs. Discussiones Mathematicae Graph Theory 25(3): 385-390 (2005)
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHamamache Kheddouci, Susan Marshall, Jean-François Saclé, Mariusz Wozniak: On the packing of three graphs. Discrete Mathematics 236(1-3): 197-225 (2001)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHamamache Kheddouci, Jean-François Saclé, Mariusz Wozniak: Packing two copies of a tree into its fourth power. Discrete Mathematics 213(1-3): 169-178 (2000)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJean-François Saclé, Mariusz Wozniak: A note on packing of three forests. Discrete Mathematics 164(1-3): 265-274 (1997)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJean-François Saclé, Mariusz Wozniak: On graphs which contain each tree of given size. Discrete Mathematics 165-166: 599-605 (1997)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJean-François Saclé, Mariusz Wozniak: The Erdös-Sós Conjecture for Graphs withoutC4. J. Comb. Theory, Ser. B 70(2): 367-372 (1997)
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMaryvonne Mahéo, Jean-François Saclé, Mariusz Wozniak: Edge-disjoint Placement of Three Trees. Eur. J. Comb. 17(6): 543-563 (1996)

Selection of 7 from 53 records - Mariusz Wozniak has 31 coauthors

Last update 2012-09-10 CET by the DBLP TeamThis material is Open Data Content released under the ODC-BY 1.0 license — See also our legal information page