Monika Pilsniak

,

,

Comb., February, 2025

A note on uniquely embeddable 2-factors.

[BibT_eX]

[DOI]

Igor Grzelec

,

,

Appl. Math. Comput., May, 2024

Total and paired domination stability in prisms.

[BibT_eX]

[DOI]

,

,

,

Elzbieta Tumidajewicz

Discuss. Math. Graph Theory, 2023

Majority Edge-Colorings of Graphs.

[BibT_eX]

[DOI]

,

,

,

,

,

Electron. J. Comb., 2023

Distinguishing arc-colourings of symmetric digraphs.

[BibT_eX]

[DOI]

,

,

Magdalena Prorok

Art Discret. Appl. Math., November, 2022

Distinguishing infinite graphs with bounded degrees.

[BibT_eX]

[DOI]

Florian Lehner

,

,

J. Graph Theory, 2022

Paired Domination in Trees.

[BibT_eX]

[DOI]

,

,

Elzbieta Kleszcz

,

Graphs Comb., 2022

Corrigendum to "A bound for the distinguishing index of regular graphs" [European J. Combin. 89 (2020) 103145].

[BibT_eX]

[DOI]

Florian Lehner

,

,

Eur. J. Comb., 2022

Extremal graphs for the distinguishing index.

[BibT_eX]

[DOI]

,

Discret. Math., 2022

Paired domination stability in graphs.

[BibT_eX]

[DOI]

,

,

,

Elzbieta Tumidajewicz

Ars Math. Contemp., 2022

Proper distinguishing arc-colourings of symmetric digraphs.

[BibT_eX]

[DOI]

,

Appl. Math. Comput., 2022

Bounds on the paired domination number of graphs with minimum degree at least three.

[BibT_eX]

[DOI]

,

,

Elzbieta Tumidajewicz

Appl. Math. Comput., 2022

On Asymmetric Colourings of Claw-Free Graphs.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2021

Nordhaus-Gaddum type inequalities for the distinguishing index.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2021

The optimal general upper bound for the distinguishing index of infinite graphs.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2020

Distinguishing index of maps.

[BibT_eX]

[DOI]

,

Thomas W. Tucker

Eur. J. Comb., 2020

A bound for the distinguishing index of regular graphs.

[BibT_eX]

[DOI]

Florian Lehner

,

,

Eur. J. Comb., 2020

On a total version of 1-2-3 Conjecture.

[BibT_eX]

[DOI]

,

,

,

,

,

Discuss. Math. Graph Theory, 2020

The distinguishing index of connected graphs without pendant edges.

[BibT_eX]

[DOI]

,

,

,

Ars Math. Contemp., 2020

Asymmetric colorings of products of graphs and digraphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2019

Edge motion and the distinguishing index.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Precise bounds for the distinguishing index of the Cartesian product.

[BibT_eX]

[DOI]

,

Theor. Comput. Sci., 2017

Distinguishing Cartesian products of countable graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discuss. Math. Graph Theory, 2017

Structural properties of recursively partitionable graphs with connectivity 2.

[BibT_eX]

[DOI]

,

,

,

Discuss. Math. Graph Theory, 2017

A note on breaking small automorphisms in graphs.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2017

Equitable neighbour-sum-distinguishing edge and total colourings.

[BibT_eX]

[DOI]

,

,

,

,

,

Discret. Appl. Math., 2017

Bounds for Distinguishing Invariants of Infinite Graphs.

[BibT_eX]

[DOI]

Wilfried Imrich

,

,

,

Mohammad Hadi Shekarriz

Electron. J. Comb., 2017

Improving upper bounds for the distinguishing index.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2017

The distinguishing index of the Cartesian product of finite graphs.

[BibT_eX]

[DOI]

,

,

Ars Math. Contemp., 2017

The distinguishing index of the Cartesian product of countable graphs.

[BibT_eX]

[DOI]

Izak Broere

,

Ars Math. Contemp., 2017

Dense arbitrarily partitionable graphs.

[BibT_eX]

[DOI]

,

,

,

Discuss. Math. Graph Theory, 2016

Preface.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2016

Distinguishing graphs by total colourings.

[BibT_eX]

[DOI]

,

,

Ars Math. Contemp., 2016

On the Total-Neighbor-Distinguishing Index by Sums.

[BibT_eX]

[DOI]

,

Graphs Comb., 2015

Distinguishing graphs by edge-colourings.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2015

The Distinguishing Index of Infinite Graphs.

[BibT_eX]

[DOI]

Izak Broere

,

Electron. J. Comb., 2015

How to personalize the vertices of a graph?

[BibT_eX]

[DOI]

,

,

,

Eur. J. Comb., 2014

Endomorphism Breaking in Graphs.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2014

Can Colour-Blind Distinguish Colour Palettes?

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2013

Coloring chip configurations on graphs and digraphs.

[BibT_eX]

[DOI]

Mieczyslaw Borowiecki

,

Jaroslaw Grytczuk

,

Inf. Process. Lett., 2012

On packing of two copies of a hypergraph.

[BibT_eX]

[DOI]

,

Discret. Math. Theor. Comput. Sci., 2011

A note on an embedding problem in transitive tournaments.

[BibT_eX]

[DOI]

Agnieszka Görlich

,

Discret. Math., 2010

On-line arbitrarily vertex decomposable suns.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2009

Arbitrarily vertex decomposable suns with few rays.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2009

A note on packing of two copies of a hypergraph.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2007

Packing of two digraphs into a transitive tournament.

[BibT_eX]

[DOI]

Discret. Math., 2007

Fixed-point-free embeddings of digraphs with small size.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2007

A note on decompositions of transitive tournaments.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2007

A note on decompositions of transitive tournaments II.

[BibT_eX]

[DOI]

,

,

,

,

Australas. J Comb., 2007

A Note on a Packing Problem in Transitive Tournaments.

[BibT_eX]

[DOI]

Agnieszka Görlich

,

,

Graphs Comb., 2006

Some families of arbitrarily vertex decomposable graphs.

[BibT_eX]

[DOI]

,

,

,

Electron. Notes Discret. Math., 2005

Packing of three copies of a digraph into the transitive tournament.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2004

A note on embedding graphs without short cycles.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2004

On cyclically embeddable (n, n)-graphs.

[BibT_eX]

[DOI]

Agnieszka Görlich

,

,