Csilla Bujtás

974 total citations
72 papers, 492 citations indexed

About

Csilla Bujtás is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Electrical and Electronic Engineering. According to data from OpenAlex, Csilla Bujtás has authored 72 papers receiving a total of 492 indexed citations (citations by other indexed papers that have themselves been cited), including 64 papers in Computational Theory and Mathematics, 32 papers in Discrete Mathematics and Combinatorics and 14 papers in Electrical and Electronic Engineering. Recurrent topics in Csilla Bujtás's work include Advanced Graph Theory Research (60 papers), Graph Labeling and Dimension Problems (32 papers) and Limits and Structures in Graph Theory (32 papers). Csilla Bujtás is often cited by papers focused on Advanced Graph Theory Research (60 papers), Graph Labeling and Dimension Problems (32 papers) and Limits and Structures in Graph Theory (32 papers). Csilla Bujtás collaborates with scholars based in Hungary, Slovenia and India. Csilla Bujtás's co-authors include Źsolt Tuza, Michael A. Henning, Sandi Klavžar, E. Sampathkumar, Vitaly Voloshin, Zs. Tuza, Szilárd Jaskó, Balázs Patkós, Boštjan Brešar and Máté Vizer and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Networks.

In The Last Decade

Csilla Bujtás

67 papers receiving 461 citations

Peers

Csilla Bujtás

CTM

DMC

EEE

CNC

GT

Geňa Hahn Canada

Wenan Zang Hong Kong

Zbigniew Lonc Poland

Garth Isaak United States

William F. Klostermeyer United States

Paul Wollan Italy

Kristina Vušković United Kingdom

Mao-cheng Cai China

Paul Dorbec France

János Barát Hungary

Geňa Hahn Canada

Csilla Bujtás

324 ×0.8

CTM

189 ×1.0

DMC

104 ×0.8

EEE

59 ×0.7

CNC

109 ×1.7

GT

Citations per year, relative to Csilla Bujtás Csilla Bujtás (= 1×) peers Geňa Hahn

Countries citing papers authored by Csilla Bujtás

Since Specialization

Citations

This map shows the geographic impact of Csilla Bujtás's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Csilla Bujtás with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Csilla Bujtás more than expected).

Fields of papers citing papers by Csilla Bujtás

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Csilla Bujtás. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Csilla Bujtás. The network helps show where Csilla Bujtás may publish in the future.

Co-authorship network of co-authors of Csilla Bujtás

This figure shows the co-authorship network connecting the top 25 collaborators of Csilla Bujtás. A scholar is included among the top collaborators of Csilla Bujtás based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Csilla Bujtás. Csilla Bujtás is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Bujtás, Csilla, et al.. (2026). Revisiting d-distance (independent) domination in trees and in bipartite graphs. Discrete Mathematics. 349(6). 114972–114972.

2.

Bujtás, Csilla & Michael A. Henning. (2025). On the domination number of graphs with minimum degree at least seven. Discrete Mathematics. 348(6). 114424–114424.

3.

Bujtás, Csilla, et al.. (2021). 1 / 2 -conjectures on the domination game and claw-free graphs. European Journal of Combinatorics. 101. 103467–103467. 4 indexed citations

4.

Brešar, Boštjan, Csilla Bujtás, Sandi Klavžar, et al.. (2021). On Grundy Total Domination Number in Product Graphs. SHILAP Revista de lepidopterología. 3 indexed citations

5.

Bujtás, Csilla. (2021). Domination Number of Graphs with Minimum Degree Five. SHILAP Revista de lepidopterología. 7 indexed citations

6.

Bujtás, Csilla, et al.. (2020). Bipartite graphs with close domination and k -domination numbers. Open Mathematics. 18(1). 873–885. 3 indexed citations

7.

Bujtás, Csilla, Michał Karpiński, Yannis Manoussakis, et al.. (2018). Tropical dominating sets in vertex-coloured graphs. Journal of Discrete Algorithms. 48. 27–41. 3 indexed citations

8.

Bujtás, Csilla & Szilárd Jaskó. (2017). Bounds on the 2-domination number. Discrete Applied Mathematics. 242. 4–15. 7 indexed citations

9.

Bujtás, Csilla & Źsolt Tuza. (2016). K3-Worm Colorings of Graphs: Lower Chromatic Number and Gaps in the Chromatic Spectrum. SHILAP Revista de lepidopterología. 5 indexed citations

10.

Bujtás, Csilla, et al.. (2016). Induced cycles in triangle graphs. Discrete Applied Mathematics. 209. 264–275. 5 indexed citations

11.

Bujtás, Csilla & Źsolt Tuza. (2015). Turán numbers and batch codes. Discrete Applied Mathematics. 186. 45–55. 7 indexed citations

12.

Bujtás, Csilla. (2015). Domination game on forests. Discrete Mathematics. 338(12). 2220–2228. 22 indexed citations

13.

Arumugam, S., et al.. (2013). Equality of domination and transversal numbers in hypergraphs. Discrete Applied Mathematics. 161(13-14). 1859–1867. 9 indexed citations

14.

Bujtás, Csilla & Źsolt Tuza. (2012). Color-bounded hypergraphs, VI: Structural and functional jumps in complexity. Discrete Mathematics. 313(19). 1965–1977. 6 indexed citations

15.

Bujtás, Csilla, Michael A. Henning, & Źsolt Tuza. (2011). Transversals and domination in uniform hypergraphs. European Journal of Combinatorics. 33(1). 62–71. 33 indexed citations

16.

Bujtás, Csilla & Źsolt Tuza. (2010). Voloshin's conjecture for C-perfect hypertrees.. SZTAKI Publication Repository (Hungarian Academy of Sciences). 48. 253–268. 3 indexed citations

17.

Bujtás, Csilla, et al.. (2010). Improper C-colorings of graphs. Discrete Applied Mathematics. 159(4). 174–186. 5 indexed citations

18.

Bujtás, Csilla & Źsolt Tuza. (2009). Color-bounded hypergraphs, IV: Stable colorings of hypertrees. Discrete Mathematics. 310(9). 1463–1474. 7 indexed citations

19.

Bacsó, Gábor, Csilla Bujtás, Źsolt Tuza, & Vitaly Voloshin. (2008). New challenges in the theory of hypergraph coloring. SZTAKI Publication Repository (Hungarian Academy of Sciences). 3 indexed citations

20.

Bujtás, Csilla & Źsolt Tuza. (2007). Orderings of uniquely colorable hypergraphs. Discrete Applied Mathematics. 155(11). 1395–1407. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact