Now showing items 1-1 of 1

    • Matamala Vásquez, Martín (2007-07)
      Let G be a graph with maximum degree d ≥ 3 and ω(G) ≤ d, where ω(G) is the clique number of the graph G. Let p1 and p2 be two positive integers such that d = p1 + p2. In this work, we prove that G has a vertex ...