According to our database
1,
Mariusz Wozniak
authored at least 101 papers
between 1993 and 2024.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2024
A note on uniquely embeddable 2-factors.
Appl. Math. Comput., May, 2024
2023
On decomposing multigraphs into locally irregular submultigraphs.
Appl. Math. Comput., September, 2023
Magneto-Thermal Thin Shell Approximation for 3D Finite Element Analysis of No-Insulation Coils.
CoRR, 2023
Majority Edge-Colorings of Graphs.
Electron. J. Comb., 2023
2022
A note on the neighbour-distinguishing index of digraphs.
Ars Math. Contemp., October, 2022
A note on packing of uniform hypergraphs.
Discuss. Math. Graph Theory, 2022
2021
On Asymmetric Colourings of Claw-Free Graphs.
Electron. J. Comb., 2021
2020
On a total version of 1-2-3 Conjecture.
Discuss. Math. Graph Theory, 2020
A note on packing two copies of a tree into a graph with small maximum degree.
Discret. Math., 2020
The distinguishing index of connected graphs without pendant edges.
Ars Math. Contemp., 2020
2019
A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions.
Discret. Math. Theor. Comput. Sci., 2019
2018
On locally irregular decompositions and the 1-2 Conjecture in digraphs.
Discret. Math. Theor. Comput. Sci., 2018
A note on a directed version of the 1-2-3 Conjecture.
Discret. Appl. Math., 2018
2017
A note on neighbor expanded sum distinguishing index.
Discuss. Math. Graph Theory, 2017
Labeled embedding of <i>(n, n-2)</i>-graphs in their complements.
Discuss. Math. Graph Theory, 2017
The neighbour-sum-distinguishing edge-colouring game.
Discret. Math., 2017
On weight choosabilities of graphs with bounded maximum average degree.
Discret. Appl. Math., 2017
A note on breaking small automorphisms in graphs.
Discret. Appl. Math., 2017
Equitable neighbour-sum-distinguishing edge and total colourings.
Discret. Appl. Math., 2017
On a directed variation of the 1-2-3 and 1-2 Conjectures.
Discret. Appl. Math., 2017
2016
Dense arbitrarily partitionable graphs.
Discuss. Math. Graph Theory, 2016
Distinguishing graphs by total colourings.
Ars Math. Contemp., 2016
AI Implementation in Military Combat Identification - A Practical Solution.
Proceedings of the Beyond Databases, Architectures and Structures. Advanced Technologies for Data Mining and Knowledge Discovery, 2016
2015
On the Total-Neighbor-Distinguishing Index by Sums.
Graphs Comb., 2015
On decomposing regular graphs into locally irregular subgraphs.
Eur. J. Comb., 2015
2014
Partitioning powers of traceable or hamiltonian graphs.
Theor. Comput. Sci., 2014
Edge-Distinguishing Index of a Graph.
Graphs Comb., 2014
Minimum Number of Palettes in Edge Colorings.
Graphs Comb., 2014
How to personalize the vertices of a graph?
Eur. J. Comb., 2014
On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph.
Discret. Math. Theor. Comput. Sci., 2014
On the structure of arbitrarily partitionable graphs with given connectivity.
Discret. Appl. Math., 2014
Labeled embedding of (n, n-2)-graphs in their complements.
CoRR, 2014
2013
Neighbor Sum Distinguishing Index.
Graphs Comb., 2013
A note on uniquely embeddable forests.
Discuss. Math. Graph Theory, 2013
Rainbow connection in sparse graphs.
Discuss. Math. Graph Theory, 2013
Can Colour-Blind Distinguish Colour Palettes?
Electron. J. Comb., 2013
2012
On minimal arbitrarily partitionable graphs.
Inf. Process. Lett., 2012
Dense Arbitrarily Vertex Decomposable Graphs.
Graphs Comb., 2012
Seifert graphs and the braid index of classical and singular links.
Discret. Math., 2012
2011
On packing of two copies of a hypergraph.
Discret. Math. Theor. Comput. Sci., 2011
Total Weight Choosability of Graphs.
Electron. J. Comb., 2011
2010
Discret. Math. Theor. Comput. Sci., 2010
A note on graphs containing all trees of a given size.
Ars Comb., 2010
2009
On-line arbitrarily vertex decomposable suns.
Discret. Math., 2009
Arbitrarily vertex decomposable suns with few rays.
Discret. Math., 2009
Decompositions of pseudographs into closed trails of even sizes.
Discret. Math., 2009
Arbitrary decompositions into open and closed trails.
Discret. Math., 2009
2008
On arbitrarily vertex decomposable trees.
Discret. Math., 2008
General neighbour-distinguishing index of a graph.
Discret. Math., 2008
Irregular edge-colorings of sums of cycles of even lengths.
Australas. J Comb., 2008
2007
New sufficient conditions for hamiltonian and pancyclic graphs.
Discuss. Math. Graph Theory, 2007
A note on packing of two copies of a hypergraph.
Discuss. Math. Graph Theory, 2007
Fixed-point-free embeddings of digraphs with small size.
Discret. Math., 2007
A note on decompositions of transitive tournaments.
Discret. Math., 2007
A Chvátal-Erdos type condition for pancyclability.
Discret. Math., 2007
A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs.
Discret. Math., 2007
On-line arbitrarily vertex decomposable trees.
Discret. Appl. Math., 2007
On Self-Complementary Cyclic Packing of Forests.
Electron. J. Comb., 2007
A note on decompositions of transitive tournaments II.
Australas. J Comb., 2007
2006
A Note on a Packing Problem in Transitive Tournaments.
Graphs Comb., 2006
On the Neighbour-Distinguishing Index of a Graph.
Graphs Comb., 2006
On neighbour-distinguishing colourings from lists.
Electron. Notes Discret. Math., 2006
Chvátal-Erdös condition and pancyclism.
Discuss. Math. Graph Theory, 2006
Arbitrarily vertex decomposable caterpillars with four or five leaves.
Discuss. Math. Graph Theory, 2006
2005
A Note on a Generalisation of Ore's Condition.
Graphs Comb., 2005
Some families of arbitrarily vertex decomposable graphs.
Electron. Notes Discret. Math., 2005
A note on maximal common subgraphs of the Dirac's family of graphs.
Discuss. Math. Graph Theory, 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
On the Achromatic Index of for a Prime <i>q</i>.
Graphs Comb., 2004
On Cyclic Packing of a Tree.
Graphs Comb., 2004
Packing of graphs and permutations--a survey.
Discret. Math., 2004
A note on embedding graphs without short cycles.
Discret. Math., 2004
A note on pancyclism of highly connected graphs.
Discret. Math., 2004
2003
On cyclically embeddable (n, n)-graphs.
Discuss. Math. Graph Theory, 2003
Cycles in hamiltonian graphs of prescribed maximum degree.
Discret. Math., 2003
2002
On cyclically embeddable (<i>n, n</i>-1)-graphs.
Discret. Math., 2002
2001
Partitioning vertices of 1-tough graphs into paths.
Theor. Comput. Sci., 2001
A note on a new condition implying pancyclism.
Discuss. Math. Graph Theory, 2001
Note on compact packing of a graph.
Discret. Math., 2001
On the packing of three graphs.
Discret. Math., 2001
A note on the vertex-distinguishing proper coloring of graphs with large minimum degree.
Discret. Math., 2001
2000
On the Loebl-Komlós-Sós conjecture.
J. Graph Theory, 2000
Packing of graphs and permutations.
Electron. Notes Discret. Math., 2000
On self-complementary supergraphs of (n, n)-graphs.
Electron. Notes Discret. Math., 2000
Packing two copies of a tree into its fourth power.
Discret. Math., 2000
1999
On the Vertex-Distinguishing Proper Edge-Colorings of Graphs.
J. Comb. Theory, Ser. B, 1999
On cyclically embeddable graphs.
Discuss. Math. Graph Theory, 1999
1998
A note on uniquely embeddable graphs.
Discuss. Math. Graph Theory, 1998
1997
The Erdös-Sós Conjecture for Graphs without<i>C</i><sub>4</sub>.
J. Comb. Theory, Ser. B, 1997
On graphs which contain each tree of given size.
Discret. Math., 1997
A note on packing of three forests.
Discret. Math., 1997
1996
On the Erdös-Sós conjecture.
J. Graph Theory, 1996
Edge-disjoint Placement of Three Trees.
Eur. J. Comb., 1996
1995
A note on careful packing of a graph.
Discuss. Math. Graph Theory, 1995
1994
Embedding Graphs of Small Size.
Discret. Appl. Math., 1994
1993
Triple placement of graphs.
Graphs Comb., 1993
A note on minimal order of a bipartite graph with exactly q quadrilaterals.
Discret. Math., 1993
