Zobrazeno 1 - 10
of 44
pro vyhledávání: '"SALES, CLÁUDIA LINHARES"'
Given a simple graph $G$, a weight function $w:E(G)\rightarrow \mathbb{N} \setminus \{0\}$, and an orientation $D$ of $G$, we define $\mu^-(D) = \max_{v \in V(G)} w_D^-(v)$, where $w^-_D(v) = \sum_{u\in N_D^{-}(v)}w(uv)$. We say that $D$ is a weighte
Externí odkaz:
http://arxiv.org/abs/1804.03884
A graph is a cograph if it is $P_4$-free. A $k$-polar partition of a graph $G$ is a partition of the set of vertices of $G$ into parts $A$ and $B$ such that the subgraph induced by $A$ is a complete multipartite graph with at most $k$ parts, and the
Externí odkaz:
http://arxiv.org/abs/1703.03500
A b-coloring of the vertices of a graph is a proper coloring where each color class contains a vertex which is adjacent to each other color class. The b-chromatic number of $G$ is the maximum integer $\chi_b(G)$ for which $G$ has a b-coloring with $\
Externí odkaz:
http://arxiv.org/abs/1610.03084
Autor:
Knox, Fiachra, de la Maza, Sebastián González Hermosillo, Mohar, Bojan, Sales, Cláudia Linhares
An orientation of a graph $G$ is proper if any two adjacent vertices have different indegrees. The proper orientation number $\overrightarrow{\chi}(G)$ of a graph $G$ is the minimum of the maximum indegree, taken over all proper orientations of $G$.
Externí odkaz:
http://arxiv.org/abs/1609.06778
Publikováno v:
In Theoretical Computer Science 1 June 2019 771:39-48
Publikováno v:
In Discrete Applied Mathematics 31 May 2019 261:219-228
We introduce the notion of k-hyperclique complexes, i.e., the largest simplicial complexes on the set [n] with a fixed k-skeleton. These simplicial complexes are a higher-dimensional analogue of clique (or flag) complexes (case k=2) and they are a ri
Externí odkaz:
http://arxiv.org/abs/math/0609119
Publikováno v:
In Discrete Applied Mathematics 2010 158(12):1229-1239
Publikováno v:
In Discrete Applied Mathematics 2009 157(17):3519-3530
Autor:
Sales, Cláudia Linhares *, Maffray, Frédéric
Publikováno v:
In Theoretical Computer Science 2004 321(2):171-194