2023
A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals.
Discret. Appl. Math., July, 2023
Partitions and well-coveredness: The graph sandwich problem.
Discret. Math., 2023
An update on the coin-moving game on the square grid.
CoRR, 2023
(k-2)-linear connected components in hypergraphs of rank k.
CoRR, 2023
2022
Structural tools for the Maker-Breaker game. Application to hypergraphs of rank 3: strategies and tractability.
CoRR, 2022
2021
The (a, b)-monochromatic transversal game on biclique-hypergraphs of powers of paths and of powers of cycles.
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021
On the Oriented Coloring of the Disjoint Union of Graphs.
Proceedings of the Combinatorial Algorithms - 32nd International Workshop, 2021
2020
On clique-inverse graphs of graphs with bounded clique number.
J. Graph Theory, 2020
Characterizations, probe and sandwich problems on (k, ℓ)-cographs.
Discret. Appl. Math., 2020
Optimal Adjacent Vertex-Distinguishing Edge-Colorings of Circulant Graphs.
CoRR, 2020
Graph Sandwich Problem for the Property of Being Well-Covered and Partitionable into k Independent Sets and ℓ Cliques.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020
2019
On Caterpillars of Game Chromatic Number 4.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019
On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers.
Discret. Math., 2019
Timber game as a counting problem.
Discret. Appl. Math., 2019
2018
Octal games on graphs: The game 0.33 on subdivided stars and bistars.
Theor. Comput. Sci., 2018
Chordal-(2, 1) graph sandwich problem with boundary conditions.
Electron. Notes Discret. Math., 2018
On the forbidden induced subgraph probe and sandwich problems.
Discret. Appl. Math., 2018
Game distinguishing numbers of Cartesian products.
Ars Math. Contemp., 2018
2017
Trinque problem: covering complete graphs by plane degree-bounded hypergraphs.
J. Comb. Optim., 2017
A New Game Invariant of Graphs: the Game Distinguishing Number.
Discret. Math. Theor. Comput. Sci., 2017
Constant 2-labellings and an application to <i>(r, a, b)</i>-covering codes.
Discuss. Math. Graph Theory, 2017
2016
On the Choosability of Claw-Free Perfect Graphs.
Graphs Comb., 2016
Relaxed Locally Identifying Coloring of Graphs.
Graphs Comb., 2016
2015
On weak odd domination and graph-based quantum secret sharing.
Theor. Comput. Sci., 2015
Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs.
Electron. Notes Discret. Math., 2015
On disjoint hypercubes in Fibonacci cubes.
Discret. Appl. Math., 2015
Solitaire Clobber played on Cartesian product of graphs.
Discret. Appl. Math., 2015
Identifying Codes in Vertex-Transitive Graphs and Strongly Regular Graphs.
Electron. J. Comb., 2015
On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015
Distinguishing Number and Circulant Graphs.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015
Timber Game with Caterpillars.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015
On the forbidden induced subgraph probe problem.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015
2014
Graphs where every k-subset of vertices is an identifying set.
Discret. Math. Theor. Comput. Sci., 2014
Solitaire clobber on circulant graphs.
Discret. Math., 2014
Identifying codes in vertex-transitive graphs.
CoRR, 2014
2013
Identifying Codes in Line Graphs.
J. Graph Theory, 2013
Oriented coloring in planar, bipartite, bounded degree 3 acyclic oriented graphs.
Electron. Notes Discret. Math., 2013
New results on variants of covering codes in Sierpiński graphs.
Des. Codes Cryptogr., 2013
(<i>a</i>, <i>b</i>)-codes in <i>Z</i>/<i>n</i><i>Z</i>.
Discret. Appl. Math., 2013
LAD models, trees, and an analog of the fundamental theorem of arithmetic.
Discret. Appl. Math., 2013
An oriented 8-coloring for acyclic oriented graphs with maximum degree 3.
Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013
2012
Locally Identifying Coloring of Graphs.
Electron. J. Comb., 2012
Quantum Secret Sharing with Graph States.
Proceedings of the Mathematical and Engineering Methods in Computer Science, 2012
On the Oriented Chromatic Number of Union of Graphs.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012
2011
Strong reducibility of powers of paths and powers of cycles on Impartial Solitaire Clobber.
Electron. Notes Discret. Math., 2011
Electron. Notes Discret. Math., 2011
On two variations of identifying codes.
Discret. Math., 2011
Optimal accessing and non-accessing structures for graph protocols
CoRR, 2011
Adaptive Identification in Torii in the King Lattice.
Electron. J. Comb., 2011
2010
Paired-Domination in Subdivided Star-Free Graphs.
Graphs Comb., 2010
Covering codes in Sierpinski graphs.
Discret. Math. Theor. Comput. Sci., 2010
2009
New results about impartial solitaire clobber.
RAIRO Oper. Res., 2009
Impartial Solitaire Clobber played on Powers of Paths.
Electron. Notes Discret. Math., 2009
Weighted perfect codes in Lee metric.
Electron. Notes Discret. Math., 2009
Subdivided graphs as isometric subgraphs of Hamming graphs.
Eur. J. Comb., 2009
On Planarity of Direct Product of multipartite Complete Graphs.
Discret. Math. Algorithms Appl., 2009
Geometrical extensions of Wythoff's game.
Discret. Math., 2009
Isometric embeddings of subdivided connected graphs into hypercubes.
Discret. Math., 2009
Weighted codes in Lee metrics.
Des. Codes Cryptogr., 2009
Combinatorial graph games.
Ars Comb., 2009
Another bridge between Nim and Wythoff.
Australas. J Comb., 2009
2008
Monochromatic Hamiltonian <i>t</i>-tight Berge-cycles in hypergraphs.
J. Graph Theory, 2008
Adaptive identification in graphs.
J. Comb. Theory, Ser. A, 2008
Paired-Domination in <i>P</i> <sub>5</sub>-Free Graphs.
Graphs Comb., 2008
On the total domination number of cross products of graphs.
Discret. Math., 2008
Identifying Codes of Cartesian Product of Two Cliques of the Same Size.
Electron. J. Comb., 2008
Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs.
Algorithmic Oper. Res., 2008
2007
Paired-domination in generalized claw-free graphs.
J. Comb. Optim., 2007
Isometric embeddings of subdivided complete graphs in the hypercube.
Electron. Notes Discret. Math., 2007
A generalization of the pentomino exclusion problem: Dislocation of graphs.
Discret. Math., 2007
On graphs having a V\{x} set as an identifying code.
Discret. Math., 2007
2006
Int. J. Found. Comput. Sci., 2006
Isometric embedding of subdivided Connected graphs in the hypercube.
Electron. Notes Discret. Math., 2006
Identifying codes of cycles.
Eur. J. Comb., 2006
Some results on total domination in direct products of graphs.
Discuss. Math. Graph Theory, 2006
Extended skew partition problem.
Discret. Math., 2006
On maximum planar induced subgraphs.
Discret. Appl. Math., 2006
A linear algorithm for minimum 1-identifying codes in oriented trees.
Discret. Appl. Math., 2006
2005
Finding H-partitions efficiently.
RAIRO Theor. Informatics Appl., 2005
Electron. Notes Discret. Math., 2005
2K<sub>2</sub>-Partition Problem.
Electron. Notes Discret. Math., 2005
Construction of Codes Identifying Sets of Vertices.
Electron. J. Comb., 2005
2004
Identifying codes in some subgraphs of the square lattice.
Theor. Comput. Sci., 2004
Coloring the Maximal Cliques of Graphs.
SIAM J. Discret. Math., 2004
On Clique-inverse graphs of K<sub>p</sub>-free graphs.
Electron. Notes Discret. Math., 2004
Nonplanar vertex deletion: maximum degree thresholds for NP/Max SNP-hardness and a <i>I</i>-approximation for finding maximum planar induced subgraphs.
Electron. Notes Discret. Math., 2004
Ramsey-type results on singletons, co-singletons and monotone sequences in large collections of sets.
Eur. J. Comb., 2004
On the choice number of claw-free perfect graphs.
Discret. Math., 2004
Graph covers using t-colourable vertex sets.
Discret. Math., 2004
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum.
Discret. Appl. Math., 2004
Stable skew partition problem.
Discret. Appl. Math., 2004
2003
On a modular domination game.
Theor. Comput. Sci., 2003
Hajós' theorem for list colorings of hypergraphs.
Discuss. Math. Graph Theory, 2003
On a list-coloring problem.
Discret. Math., 2003
Isometric embeddings of subdivided wheels in hypercubes.
Discret. Math., 2003
Coloring the hypergraph of maximal cliques of a graph with no long path.
Discret. Math., 2003
2002
Three Moves on Signed Surface Triangulations.
J. Comb. Theory, Ser. B, 2002
Flips Signés et Triangulations d'un Polygone.
Eur. J. Comb., 2002
Complexity of list coloring problems with a fixed total number of colors.
Discret. Appl. Math., 2002
Total domination number of grid graphs.
Discret. Appl. Math., 2002
2001
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum.
Electron. Notes Discret. Math., 2001
On the nonexistence of three-dimensional tiling in the Lee metric II.
Discret. Math., 2001
On Tucker's proof of the strong perfect graph conjecture for (<i>K</i><sub>4</sub>-<i>e</i>)-free graphs.
Discret. Math., 2001
On the Pentomino Exclusion Problem.
Discret. Comput. Geom., 2001
Bounds on domination number of complete grid graphs.
Ars Comb., 2001
2000
Critical graphs for clique-coloring.
Electron. Notes Discret. Math., 2000
1999
On Tucker vertices of graphs.
Discret. Math., 1999
On the complexity of a restricted list-coloring problem.
Discret. Math., 1999
Domination Number of the Cross Product of Paths.
Discret. Appl. Math., 1999
1998
Graphs whose choice number is equal to their chromatic number.
J. Graph Theory, 1998
On the Non-existence of 3-Dimensional Tiling in the Lee Metric.
Eur. J. Comb., 1998
An algorithm for coloring some perfect graphs.
Discret. Math., 1998
1997
Choice number of 3-colorable elementary graphs.
Discret. Math., 1997
Hamiltonicity of the cross product of two Hamiltonian graphs.
Discret. Math., 1997
On Domination Numbers of Cartesian Product of Paths.
Discret. Appl. Math., 1997
1996
On weakly diamond-free Berge graphs.
Discret. Math., 1996
A Hajós-like theorem for list coloring.
Discret. Math., 1996
1995
On the domination number of cross products of graphs.
Discret. Math., 1995
