We show that two results on covering of edge colored graphs by monochromatic connected parts can be extended to partitioning. We prove that for any 2-edgecolored non-trivial r-uniform hypergraph H,… (More)

OBJECTIVES
This study characterized mortality in a group of Mexican children (n = 18, mean [+/- SD] age 9.9 +/- 3 years) with primary pulmonary hypertension and investigated the factors associated… (More)

For r ≥ 2, α ≥ r − 1 and k ≥ 1, let c(r, α, k) be the smallest integer c such that the vertex set of any non-trivial r-uniform k-edge-colored hypergraph H with α(H) = α can be covered by c… (More)

An edge of a graph is called dot-critical if its contraction decreases the domination number. A graph is said to be dot-critical if all of its edges are dot-critical. A vertex of a graph is called… (More)

A semi-coloring is a fractional-type edge coloring of graphs. Daniely and Linial (J Graph Theory 69:426–440, 2012) conjectured that every graph has a semicoloring. In this paper, we give an… (More)

Let H be a set of connected graphs. A graph G is said to be H-free if G does not contain any element of H as an induced subgraph. Let Fk(H) be the set of k-connected H-free graphs. When we study the… (More)

We let γ(G) and i(G) denote the domination number and the independent domination number ofG, respectively. Recently, Rad and Volkmann conjectured that i(G)/γ(G) ≤ ∆(G)/2 for every graph G, where ∆(G)… (More)