3 citations · 3 across the 6 of their papers we have counts for
7 papers
Two-coloring cubic graphs with small monochromatic components, but without singletons
János Barát, Zoltán L. Blázsik
We combine two coloring aspects that work in opposite directions. One can 2-color the vertices of a cubic graph such that each monochromatic component is very small. One can also 2…
On the number of edges in saturated partial embeddings of maximal planar graphs
János Barát, Zoltán L. Blázsik, Balázs Keszegh +1
We investigate the extremal properties of saturated partial plane embeddings of maximal planar graphs. For a planar graph , the plane-saturation number $\mathrm{sat}_{\mathcal{P…
Characterization of graphs with orientable total domination number equal to
Zoltán L. Blázsik, Leila Vivien Nagy
In a directed graph , a vertex subset is a total dominating set if every vertex of has an in-neighbor from . A total dominating set exists if and only if e…
The connection between the chromatic numbers of a hypergraph and its -intersection graph
Zoltán L. Blázsik, Nathan W. Lemons
A well known problem from an excellent book of Lovász states that any hypergraph with the property that no pair of hyperedges intersect in exactly one vertex can be properly 2-colo…
Improved upper bound on the Frank number of -edge-connected graphs
János Barát, Zoltán L. Blázsik
In an orientation of the graph , an arc is deletable if and only if is strongly connected. For a -edge-connected graph , the Frank number is the minimum …
General sharp upper bounds on the total coalition number
János Barát, Zoltán L. Blázsik
Let be a finite, simple, isolate-free graph. Two disjoint sets form a total coalition in , if none of them is a total dominating set, but their union $A\…
Quest for graphs of Frank number
János Barát, Zoltán L. Blázsik
In an orientation of the graph , the edge is deletable if and only if is strongly connected. For a -edge-connected graph , Hörsch and Szigeti defined the Fra…