Csilla Bujtás

According to our database1, Csilla Bujtás authored at least 54 papers between 2006 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
On Specific Factors in Graphs.
Graphs Comb., 2020

Clique coverings and claw-free graphs.
Eur. J. Comb., 2020

Z-domination game.
Discret. Math., 2020

General upper bound on the game domination number.
Discret. Appl. Math., 2020

2019
Disjoint Paired-Dominating sets in Cubic Graphs.
Graphs Comb., 2019

Domination game on uniform hypergraphs.
Discret. Appl. Math., 2019

Fractional Domination Game.
Electron. J. Comb., 2019

Relating the total domination number and the annihilation number of cactus graphs and block graphs.
Ars Math. Contemp., 2019

2018
Tropical dominating sets in vertex-coloured graphs.
J. Discrete Algorithms, 2018

On the Game Total Domination Number.
Graphs Comb., 2018

Bounds on the 2-domination number.
Discret. Appl. Math., 2018

Partition-Crossing Hypergraphs.
Acta Cybern., 2018

2017
Bounds on the game transversal number in hypergraphs.
Eur. J. Comb., 2017

The minimum number of vertices in uniform hypergraphs with given domination number.
Discret. Math., 2017

Grundy dominating sequences and zero forcing sets.
Discret. Optim., 2017

F-WORM colorings: Results for 2-connected graphs.
Discret. Appl. Math., 2017

2016
New models of graph-bin packing.
Theor. Comput. Sci., 2016

Transversal Game on Hypergraphs and the 3/4-Conjecture on the Total Domination Game.
SIAM J. Discret. Math., 2016

Improved Upper Bounds on the Domination Number of Graphs With Minimum Degree at Least Five.
Graphs Comb., 2016

<i>K<sub>3</sub></i>-WORM colorings of graphs: Lower chromatic number and gaps in the chromatic spectrum.
Discuss. Math. Graph Theory, 2016

The Disjoint Domination Game.
Discret. Math., 2016

Induced cycles in triangle graphs.
Discret. Appl. Math., 2016

Dominating Sequences in Grid-Like and Toroidal Graphs.
Electron. J. Comb., 2016

When the vertex coloring of a graph is an edge coloring of its line graph - a rare coincidence.
Ars Comb., 2016

Tropical Dominating Sets in Vertex-Coloured Graphs.
Proceedings of the WALCOM: Algorithms and Computation - 10th International Workshop, 2016

2015
Domination game critical graphs.
Discuss. Math. Graph Theory, 2015

Approximability of the upper chromatic number of hypergraphs.
Discret. Math., 2015

Domination game on forests.
Discret. Math., 2015

Turán numbers and batch codes.
Discret. Appl. Math., 2015

Generalized Line Graphs: Cartesian Products and Complexity of Recognition.
Electron. J. Comb., 2015

On the Game Domination Number of Graphs with Given Minimum Degree.
Electron. J. Comb., 2015

Maximum number of colors in hypertrees of bounded degree.
Central Eur. J. Oper. Res., 2015

2014
Total Transversals and Total Domination in Uniform Hypergraphs.
Electron. J. Comb., 2014

2013
Color-bounded hypergraphs, VI: Structural and functional jumps in complexity.
Discret. Math., 2013

Equality of domination and transversal numbers in hypergraphs.
Discret. Appl. Math., 2013

2012
Small Edge Sets Meeting all Triangles of a Graph.
Graphs Comb., 2012

Transversals and domination in uniform hypergraphs.
Eur. J. Comb., 2012

Vertex coloring without large polychromatic stars.
Discret. Math., 2012

3-consecutive edge coloring of a graph.
Discret. Math., 2012

2011
The Graph-Bin Packing Problem.
Int. J. Found. Comput. Sci., 2011

Combinatorial batch codes: Extremal problems under Hall-type conditions.
Electron. Notes Discret. Math., 2011

Color-bounded hypergraphs, V: host graphs and subdivisions.
Discuss. Math. Graph Theory, 2011

Improper C-colorings of graphs.
Discret. Appl. Math., 2011

Optimal batch codes: Many items or low retrieval requirement.
Adv. Math. Commun., 2011

2010
C-perfect hypergraphs.
J. Graph Theory, 2010

3-consecutive C-colorings of graphs.
Discuss. Math. Graph Theory, 2010

Color-bounded hypergraphs, IV: Stable colorings of hypertrees.
Discret. Math., 2010

Voloshin's conjecture for C-perfect hypertrees.
Australas. J Comb., 2010

2009
Smallest Set-Transversals of <i>k</i>-Partitions.
Graphs Comb., 2009

Color-bounded hypergraphs, II: Interval hypergraphs and hypertrees.
Discret. Math., 2009

Color-bounded hypergraphs, I: General results.
Discret. Math., 2009

2008
Uniform Mixed Hypergraphs: The Possible Numbers of Colors.
Graphs Comb., 2008

2007
Orderings of uniquely colorable hypergraphs.
Discret. Appl. Math., 2007

2006
Mixed colorings of hypergraphs.
Electron. Notes Discret. Math., 2006


  Loading...