Ademir Hujdurovic

Ðorde Mitrovic

J. Graph Theory, January, 2024

2022

Three local actions in 6-valent arc-transitive graphs.

[BibT_eX]

[DOI]

Primoz Potocnik

Gabriel Verret

J. Graph Theory, 2022

Canonical double covers of circulants.

[BibT_eX]

[DOI]

Blas Fernández

J. Comb. Theory B, 2022

On intersection density of transitive groups of degree a product of two odd primes.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2022

On maximum intersecting sets in direct and wreath product of groups.

[BibT_eX]

[DOI]

Eur. J. Comb., 2022

On some problems regarding distance-balanced graphs.

[BibT_eX]

[DOI]

Blas Fernández

Eur. J. Comb., 2022

2021

On Automorphisms of the Double Cover of a Circulant Graph.

[BibT_eX]

[DOI]

Dorde Mitrovic

Dave Witte Morris

Electron. J. Comb., 2021

2020

Strong cliques in vertex-transitive graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2020

Mind the independence gap.

[BibT_eX]

[DOI]

Discret. Math., 2020

2019

Detecting strong cliques.

[BibT_eX]

[DOI]

Bernard Ries

Discret. Math., 2019

Graphs with Cayley canonical double covers.

[BibT_eX]

[DOI]

Discret. Math., 2019

MIPUP: minimum perfect unmixed phylogenies for multi-sampled tumors via branchings and ILP.

[BibT_eX]

[DOI]

Bioinform., 2019

Quasi-semiregular automorphisms of cubic and tetravalent arc-transitive graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2019

2018

Complexity and Algorithms for Finding a Perfect Phylogeny from Mixed Tumor Samples.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2018

Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth's Theorem.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2018

On Almost Well-Covered Graphs of Girth at Least 6.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2018

Graphs vertex-partitionable into strong cliques.

[BibT_eX]

[DOI]

Bernard Ries

Discret. Math., 2018

Enumerating graphs via even/odd dichotomy.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

On normality of <i>n</i>-Cayley graphs.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2018

2017

Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs.

[BibT_eX]

[DOI]

Didem Gözüpek

Discret. Math. Theor. Comput. Sci., 2017

Quasi-λ-distance-balanced graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Almost Well-Covered Graphs Without Short Cycles.

[BibT_eX]

[DOI]

CoRR, 2017

The minimum conflict-free row split problem revisited: a branching formulation and (in)approximability issues.

[BibT_eX]

[DOI]

CoRR, 2017

Minimal dominating sets in lexicographic product graphs.

[BibT_eX]

[DOI]

Didem Gözüpek

CoRR, 2017

Vertex-transitive digraphs with extra automorphisms that preserve the natural arc-colouring.

[BibT_eX]

[DOI]

Australas. J Comb., 2017

The Minimum Conflict-Free Row Split Problem Revisited.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

2016

On colour-preserving automorphisms of Cayley graphs.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2016

Odd automorphisms in vertex-transitive graphs.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2016

2015

On Bounds for the Product Irregularity Strength of Graphs.

[BibT_eX]

[DOI]

Ratko Darda

Graphs Comb., 2015

Vertex-transitive generalized Cayley graphs which are not Cayley graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2015

Vertex-transitive CIS graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2015

Finding a Perfect Phylogeny from Mixed Tumor Samples.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics - 15th International Workshop, 2015

2014

Half-arc-transitive group actions with a small number of alternets.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2014

2013

Quasi m-Cayley circulants.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2013

On Prime-Valent Symmetric Bicirculants and Cayley Snarks.

[BibT_eX]

[DOI]