default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCsilla Bujtás
Person information
- affiliation: University of Pannonia, Hungary
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j67]Csilla Bujtás
, Akbar Davoodi, Laihao Ding, Ervin Györi, Zsolt Tuza, Donglei Yang:
Covering the edges of a graph with triangles. Discret. Math. 348(1): 114226 (2025)- 2024
- [j66]Csilla Bujtás, Pakanun Dokyeesun:
Fast winning strategies for Staller in the Maker-Breaker domination game. Discret. Appl. Math. 344: 10-22 (2024) - [j65]Csilla Bujtás, Michael A. Henning, Sandi Klavzar:
Partial domination in supercubic graphs. Discret. Math. 347(1): 113669 (2024) - [j64]Bostjan Bresar, Csilla Bujtás, Vesna Irsic, Douglas F. Rall, Zsolt Tuza:
Indicated domination game. Discret. Math. 347(9): 114060 (2024) - [j63]Gülnaz Boruzanli Ekinci, Csilla Bujtás:
On the equality of domination number and 2-domination number. Discuss. Math. Graph Theory 44(1): 383 (2024) - 2023
- [j62]Csilla Bujtás, Nima Ghanbari, Sandi Klavzar:
Computational complexity aspects of super domination. Theor. Comput. Sci. 975: 114137 (2023) - 2022
- [j61]Csilla Bujtás, Vesna Irsic, Sandi Klavzar:
1/2-conjectures on the domination game and claw-free graphs. Eur. J. Comb. 101: 103467 (2022) - [j60]Csilla Bujtás, Vesna Irsic, Sandi Klavzar:
Predominating a Vertex in the Connected Domination Game. Graphs Comb. 38(3): 77 (2022) - [j59]Csilla Bujtás, Marko Jakovac, Zsolt Tuza:
The k-path vertex cover: General bounds and chordal graphs. Networks 80(1): 63-76 (2022) - 2021
- [j58]Csilla Bujtás, Mario Gionfriddo, Elena Guardo, Lorenzo Milazzo, Salvatore Milici, Zsolt Tuza:
Complex uniformly resolvable decompositions of K_v. Ars Math. Contemp. 21(1) (2021) - [j57]Csilla Bujtás, Michael A. Henning:
On the domination number of graphs with minimum degree six. Discret. Math. 344(8): 112449 (2021) - [j56]Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Tilen Marc, Balázs Patkós, Zsolt Tuza, Máté Vizer:
On Grundy total domination number in product graphs. Discuss. Math. Graph Theory 41(1): 225-247 (2021) - [j55]Csilla Bujtás:
Domination number of graphs with minimum degree five. Discuss. Math. Graph Theory 41(3): 763-777 (2021) - 2020
- [j54]Csilla Bujtás:
General upper bound on the game domination number. Discret. Appl. Math. 285: 530-538 (2020) - [j53]Csilla Bujtás, Vesna Irsic, Sandi Klavzar:
Z-domination game. Discret. Math. 343(11): 112076 (2020) - [j52]Csilla Bujtás, Akbar Davoodi, Ervin Györi, Zsolt Tuza:
Clique coverings and claw-free graphs. Eur. J. Comb. 88: 103114 (2020) - [j51]Csilla Bujtás, Stanislav Jendrol', Zsolt Tuza:
On Specific Factors in Graphs. Graphs Comb. 36(5): 1391-1399 (2020) - [j50]Csilla Bujtás, Stanislav Jendrol', Zsolt Tuza:
On caterpillar factors in graphs. Theor. Comput. Sci. 846: 82-90 (2020)
2010 – 2019
- 2019
- [j49]Csilla Bujtás, Marko Jakovac:
Relating the total domination number and the annihilation number of cactus graphs and block graphs. Ars Math. Contemp. 16(1): 183-202 (2019) - [j48]Csilla Bujtás, Zsolt Tuza:
Fractional Domination Game. Electron. J. Comb. 26(4): 4 (2019) - [j47]Csilla Bujtás, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Domination game on uniform hypergraphs. Discret. Appl. Math. 258: 65-75 (2019) - [j46]Gábor Bacsó, Csilla Bujtás, Casey Tompkins, Zsolt Tuza:
Disjoint Paired-Dominating sets in Cubic Graphs. Graphs Comb. 35(5): 1129-1138 (2019) - 2018
- [j45]Csilla Bujtás, Zsolt Tuza:
Partition-Crossing Hypergraphs. Acta Cybern. 23(3): 815-828 (2018) - [j44]Csilla Bujtás, Szilárd Jaskó:
Bounds on the 2-domination number. Discret. Appl. Math. 242: 4-15 (2018) - [j43]Csilla Bujtás:
On the Game Total Domination Number. Graphs Comb. 34(3): 415-425 (2018) - [j42]Jean-Alexandre Anglès d'Auriac, Csilla Bujtás, Abdelhakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero, N. Narayanan, Laurent Rosaz, Johan Thapper, Zsolt Tuza:
Tropical dominating sets in vertex-coloured graphs. J. Discrete Algorithms 48: 27-41 (2018) - 2017
- [j41]Csilla Bujtás, Zsolt Tuza:
F-WORM colorings: Results for 2-connected graphs. Discret. Appl. Math. 231: 131-138 (2017) - [j40]Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Grundy dominating sequences and zero forcing sets. Discret. Optim. 26: 66-77 (2017) - [j39]Csilla Bujtás, Balázs Patkós, Zsolt Tuza, Máté Vizer:
The minimum number of vertices in uniform hypergraphs with given domination number. Discret. Math. 340(11): 2704-2713 (2017) - [j38]Csilla Bujtás, Michael A. Henning, Zsolt Tuza:
Bounds on the game transversal number in hypergraphs. Eur. J. Comb. 59: 34-50 (2017) - 2016
- [j37]Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha:
When the vertex coloring of a graph is an edge coloring of its line graph - a rare coincidence. Ars Comb. 128: 165-173 (2016) - [j36]Bostjan Bresar, Csilla Bujtás, Tanja Gologranc, Sandi Klavzar, Gasper Kosmrlj, Balázs Patkós, Zsolt Tuza, Máté Vizer:
Dominating Sequences in Grid-Like and Toroidal Graphs. Electron. J. Comb. 23(4): 4 (2016) - [j35]S. Aparna Lakshmanan, Csilla Bujtás, Zsolt Tuza:
Induced cycles in triangle graphs. Discret. Appl. Math. 209: 264-275 (2016) - [j34]Csilla Bujtás, Zsolt Tuza:
The Disjoint Domination Game. Discret. Math. 339(7): 1985-1992 (2016) - [j33]Csilla Bujtás, Zsolt Tuza:
K3-WORM colorings of graphs: Lower chromatic number and gaps in the chromatic spectrum. Discuss. Math. Graph Theory 36(3): 759-772 (2016) - [j32]Csilla Bujtás, Sandi Klavzar:
Improved Upper Bounds on the Domination Number of Graphs With Minimum Degree at Least Five. Graphs Comb. 32(2): 511-519 (2016) - [j31]Csilla Bujtás, Michael A. Henning, Zsolt Tuza:
Transversal Game on Hypergraphs and the 3/4-Conjecture on the Total Domination Game. SIAM J. Discret. Math. 30(3): 1830-1847 (2016) - [j30]Csilla Bujtás, György Dósa, Csanád Imreh, Judit Nagy-György, Zsolt Tuza:
New models of graph-bin packing. Theor. Comput. Sci. 640: 94-103 (2016) - [c1]Jean-Alexandre Anglès d'Auriac, Csilla Bujtás, Hakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero, Narayanan Narayanan, Laurent Rosaz, Johan Thapper, Zsolt Tuza:
Tropical Dominating Sets in Vertex-Coloured Graphs. WALCOM 2016: 17-27 - 2015
- [j29]Csilla Bujtás, Zsolt Tuza:
Maximum number of colors in hypertrees of bounded degree. Central Eur. J. Oper. Res. 23(4): 867-876 (2015) - [j28]Csilla Bujtás:
On the Game Domination Number of Graphs with Given Minimum Degree. Electron. J. Comb. 22(3): 3 (2015) - [j27]S. Aparna Lakshmanan, Csilla Bujtás, Zsolt Tuza:
Generalized Line Graphs: Cartesian Products and Complexity of Recognition. Electron. J. Comb. 22(3): 3 (2015) - [j26]Csilla Bujtás, Zsolt Tuza:
Turán numbers and batch codes. Discret. Appl. Math. 186: 45-55 (2015) - [j25]Csilla Bujtás, Zsolt Tuza:
Approximability of the upper chromatic number of hypergraphs. Discret. Math. 338(10): 1714-1721 (2015) - [j24]Csilla Bujtás:
Domination game on forests. Discret. Math. 338(12): 2220-2228 (2015) - [j23]Csilla Bujtás, Sandi Klavzar, Gasper Kosmrlj:
Domination game critical graphs. Discuss. Math. Graph Theory 35(4): 781-796 (2015) - [i1]Jean-Alexandre Anglès d'Auriac, Csilla Bujtás, Hakim El Maftouhi, Marek Karpinski, Yannis Manoussakis, Leandro Montero, N. Narayanan, Laurent Rosaz, Johan Thapper, Zsolt Tuza:
Tropical Dominating Sets in Vertex-Coloured Graphs. CoRR abs/1503.01008 (2015) - 2014
- [j22]Csilla Bujtás, Michael A. Henning, Zsolt Tuza, Anders Yeo:
Total Transversals and Total Domination in Uniform Hypergraphs. Electron. J. Comb. 21(2): 2 (2014) - 2013
- [j21]S. Arumugam, Bibin K. Jose, Csilla Bujtás, Zsolt Tuza:
Equality of domination and transversal numbers in hypergraphs. Discret. Appl. Math. 161(13-14): 1859-1867 (2013) - [j20]Csilla Bujtás, Zsolt Tuza:
Color-bounded hypergraphs, VI: Structural and functional jumps in complexity. Discret. Math. 313(19): 1965-1977 (2013) - 2012
- [j19]Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha:
3-consecutive edge coloring of a graph. Discret. Math. 312(3): 561-573 (2012) - [j18]Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, Charles Dominic, L. Pushpalatha:
Vertex coloring without large polychromatic stars. Discret. Math. 312(14): 2102-2108 (2012) - [j17]Csilla Bujtás, Michael A. Henning, Zsolt Tuza:
Transversals and domination in uniform hypergraphs. Eur. J. Comb. 33(1): 62-72 (2012) - [j16]S. Aparna Lakshmanan, Csilla Bujtás, Zsolt Tuza:
Small Edge Sets Meeting all Triangles of a Graph. Graphs Comb. 28(3): 381-392 (2012) - 2011
- [j15]Csilla Bujtás, Zsolt Tuza:
Optimal batch codes: Many items or low retrieval requirement. Adv. Math. Commun. 5(3): 529-541 (2011) - [j14]Csilla Bujtás, E. Sampathkumar, Zsolt Tuza, L. Pushpalatha, R. C. Vasundhara:
Improper C-colorings of graphs. Discret. Appl. Math. 159(4): 174-186 (2011) - [j13]Csilla Bujtás, Zsolt Tuza, Vitaly I. Voloshin:
Color-bounded hypergraphs, V: host graphs and subdivisions. Discuss. Math. Graph Theory 31(2): 223-238 (2011) - [j12]Csilla Bujtás, Zsolt Tuza:
Combinatorial batch codes: Extremal problems under Hall-type conditions. Electron. Notes Discret. Math. 38: 201-206 (2011) - [j11]Csilla Bujtás, György Dósa, Csanád Imreh, Judit Nagy-György, Zsolt Tuza:
The Graph-Bin Packing Problem. Int. J. Found. Comput. Sci. 22(8): 1971-1993 (2011) - 2010
- [j10]Csilla Bujtás, Zsolt Tuza:
Voloshin's conjecture for C-perfect hypertrees. Australas. J Comb. 48: 253-268 (2010) - [j9]Csilla Bujtás, Zsolt Tuza:
Color-bounded hypergraphs, IV: Stable colorings of hypertrees. Discret. Math. 310(9): 1463-1474 (2010) - [j8]Csilla Bujtás, Charles Dominic, E. Sampathkumar, M. S. Subramanya, Zsolt Tuza:
3-consecutive C-colorings of graphs. Discuss. Math. Graph Theory 30(3): 393-405 (2010) - [j7]Csilla Bujtás, Zsolt Tuza:
C-perfect hypergraphs. J. Graph Theory 64(2): 132-149 (2010)
2000 – 2009
- 2009
- [b1]Csilla Bujtás:
Halmazpartíciók lokális feltételekkel. University of Pannonia, Hungary, 2009 - [j6]Csilla Bujtás, Zsolt Tuza:
Color-bounded hypergraphs, I: General results. Discret. Math. 309(15): 4890-4902 (2009) - [j5]Csilla Bujtás, Zsolt Tuza:
Color-bounded hypergraphs, II: Interval hypergraphs and hypertrees. Discret. Math. 309(22): 6391-6401 (2009) - [j4]Csilla Bujtás, Zsolt Tuza:
Smallest Set-Transversals of k-Partitions. Graphs Comb. 25(6): 807-816 (2009) - 2008
- [j3]Csilla Bujtás, Zsolt Tuza:
Uniform Mixed Hypergraphs: The Possible Numbers of Colors. Graphs Comb. 24(1): 1-12 (2008) - 2007
- [j2]Csilla Bujtás, Zsolt Tuza:
Orderings of uniquely colorable hypergraphs. Discret. Appl. Math. 155(11): 1395-1407 (2007) - 2006
- [j1]Csilla Bujtás, Zsolt Tuza:
Mixed colorings of hypergraphs. Electron. Notes Discret. Math. 24: 273-275 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
