The following pages link to Csilla Bujtás (Q279226):
Displaying 50 items.
- The disjoint domination game (Q279227) (← links)
- Transversal designs and induced decompositions of graphs (Q286751) (← links)
- Improved upper bounds on the domination number of graphs with minimum degree at least five (Q292247) (← links)
- Induced cycles in triangle graphs (Q298987) (← links)
- Maximum number of colors in hypertrees of bounded degree (Q302137) (← links)
- Bounds on the game transversal number in hypergraphs (Q326647) (← links)
- Color-bounded hypergraphs. VI: Structural and functional jumps in complexity (Q383764) (← links)
- Total transversals and total domination in uniform hypergraphs (Q405218) (← links)
- Maximum number of colors: C-coloring and related problems (Q408951) (← links)
- Vertex coloring without large polychromatic stars (Q432703) (← links)
- Dominating sequences in grid-like and toroidal graphs (Q504964) (← links)
- Improper C-colorings of graphs (Q629357) (← links)
- Optimal batch codes: many items or low retrieval requirement (Q644328) (← links)
- Transversals and domination in uniform hypergraphs (Q649007) (← links)
- 3-consecutive edge coloring of a graph (Q658096) (← links)
- \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum (Q726653) (← links)
- On the game domination number of graphs with given minimum degree (Q888585) (← links)
- Generalized line graphs: Cartesian products and complexity of recognition (Q888591) (← links)
- Domination game critical graphs (Q891326) (← links)
- Smallest set-transversals of \(k\)-partitions (Q968226) (← links)
- Color-bounded hypergraphs, IV: Stable colorings of hypertrees (Q968415) (← links)
- Orderings of uniquely colorable hypergraphs (Q997065) (← links)
- Color-bounded hypergraphs. I: General results (Q1044919) (← links)
- Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees (Q1045172) (← links)
- On the game total domination number (Q1637096) (← links)
- Domination game on uniform hypergraphs (Q1732097) (← links)
- Bounds on the 2-domination number (Q1744236) (← links)
- Tropical dominating sets in vertex-coloured graphs (Q1748204) (← links)
- Extended bicolorings of Steiner triple systems of order \(2^{h}-1\) (Q1750737) (← links)
- Grundy dominating sequences and zero forcing sets (Q1751247) (← links)
- (Q1926042) (redirect page) (← links)
- Small edge sets meeting all triangles of a graph (Q1926043) (← links)
- The variety of domination games (Q2007624) (← links)
- On the domination number of graphs with minimum degree six (Q2032873) (← links)
- Bipartite graphs with close domination and \(k\)-domination numbers (Q2053423) (← links)
- \( 1 / 2\)-conjectures on the domination game and claw-free graphs (Q2066003) (← links)
- Connected domination game played on Cartesian products (Q2111699) (← links)
- The domination game played on diameter 2 graphs (Q2118161) (← links)
- Predominating a vertex in the connected domination game (Q2121488) (← links)
- Clique coverings and claw-free graphs (Q2189831) (← links)
- General upper bound on the game domination number (Q2197467) (← links)
- Z-domination game (Q2198397) (← links)
- On caterpillar factors in graphs (Q2210502) (← links)
- On Grundy total domination number in product graphs (Q2214319) (← links)
- On specific factors in graphs (Q2227979) (← links)
- Fractional domination game (Q2327216) (← links)
- Disjoint paired-dominating sets in cubic graphs (Q2334075) (← links)
- Turán numbers and batch codes (Q2345596) (← links)
- Approximability of the upper chromatic number of hypergraphs (Q2346334) (← links)
- The minimum number of vertices in uniform hypergraphs with given domination number (Q2401806) (← links)
