Exploració per tema "Chromatic number"

Ara es mostren els items 1-4 de 4

    • Chromatic number in random scaled sector graphs 

      Díaz Cort, Josep; Sanwalani, Vishal; Serna Iglesias, María José; Spirakis, Paul George (2004-04)
      Report de recerca
      Accés obert
      In this paper, we introduce a new model of random graph that we call random sector graph. This model aims to provide a tool for studying communication problems in networks of sensors using laser communication such as ...

    • Degrees in oriented hypergraphs and Ramsey p-chromatic number 

      Caro, Y.; Hansberg Pastor, Adriana (2012-08)
      Article
      Accés restringit per política de l'editorial
      The family D(k,m) of graphs having an orientation such that for every vertex v ∈ V (G) either (outdegree) deg+(v) ≤ k or (indegree) deg−(v) ≤ m have been investigated recently in several papers because of the role D(k,m) ...

    • Optimization of eigenvalue bounds for the independence and chromatic number of graph powers 

      Abiad, Aida; Coutinho, Gabriel; Fiol Mora, Miquel Àngel; Nogueira, Bruno; Zeijlemaker, Shanne (2022-03)
      Article
      Accés obert
      The k-thpower of a graph G=(V,E), G^k, is the graph whose vertex set is V and in which two distinct vertices are adjacent if and only if their distance in G is at most k. This article proves various eigenvalue bounds for ...

    • Partitions of graphs into small and large sets 

      Bojilov, Asen; Caro, Yair; Hansberg Pastor, Adriana; Nedyalko, Nevno (2013-09)
      Article
      Accés restringit per política de l'editorial
      Let GG be a graph on nn vertices. We call a subset AA of the vertex set V(G)V(G)kk-small if, for every vertex v∈Av∈A, deg(v)≤n−|A|+kdeg(v)≤n−|A|+k. A subset B⊆V(G)B⊆V(G) is called kk-large if, for every vertex u∈Bu∈B, ...