#### Filter Results:

- Full text PDF available (17)

#### Publication Year

2004

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Júlio Araújo, Nathann Cohen, Frédéric Giroire, Frédéric Havet
- Electronic Notes in Discrete Mathematics
- 2009

A good edge-labelling of a graph G is a labelling of its edges such that for any two distinct vertices u, v, there is at most one (u, v)-path with non-decreasing labels. This notion was introduced in [3] to solve wavelength assignment problems for specific categories of graphs. In this paper, we aim at characterizing the class of graphs that admit a good… (More)

- Júlio Araújo, Cláudia Linhares Sales
- Electronic Notes in Discrete Mathematics
- 2009

In this article, we define a new class of graphs, the fat-extended P 4-laden graphs, and we show a polynomial time algorithm to determine the Grundy number of the graphs in this class. This result implies that the Grundy number can be found in polynomial time for any graph of the following classes: P 4

- Laurie Bergstrom, David E Yocum, +11 authors Christianne M Yung
- Arthritis and rheumatism
- 2004

OBJECTIVE
To describe a group of patients who were treated with tumor necrosis factor alpha (TNF alpha) antagonists and who developed coccidioidomycosis, and to test the hypothesis that patients with inflammatory arthritis receiving TNF alpha antagonist therapy are at higher risk for developing symptomatic coccidioidomycosis.
METHODS
Cases of… (More)

- Júlio Antônio Pereira Araújo, Danilo Mesquita, Wilson de Melo Cruvinel, Karina Inácio Salmazi, Esper Georges Kallás, Luis Eduardo Coelho Andrade
- Revista brasileira de reumatologia
- 2016

INTRODUCTION/OBJECTIVE
Recent evidence suggests that abnormalities involving Th17 lymphocytes are associated with the pathophysiology of systemic lupus erythematosus (SLE). In addition, multifunctional T cells (MFT), i.e., those producing multiple cytokines simultaneously, are present in the inflammatory milieu and may be implicated in the autoimmune… (More)

- Júlio Araújo, Victor A. Campos, Frédéric Giroire, Nicolas Nisse, Leonardo Sampaio, R. Soares
- Theor. Comput. Sci.
- 2011

Given a graph G = (V, E), the closed interval of a pair of vertices u, v ∈ V , denoted by I[u, v], is the set of vertices that belongs to some shortest (u, v)-path. The convex hull I h [S] of a subset S ⊆ V is the smallest convex set that contains S. We say that S is a hull set if I h [S] = V. The cardinality of a minimum hull set of G is the hull number of… (More)

In this paper, we study a colouring problem motivated by a practical frequency assignment problem and up to our best knowledge new. In wireless networks, a node interferes with the other nodes the level of interference depending on numerous parameters: distance between the nodes, geographical topography, obstacles, etc. We model this with a weighted graph G… (More)

- Júlio Araújo, Frédéric Giroire, Julian Monteiro
- Globe
- 2011

HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion… (More)

- Júlio Araújo, G. Morel, Leonardo Sampaio, R. Soares, Valentin Weber
- Discrete Applied Mathematics
- 2013

In this paper, we study the (geodesic) hull number of graphs. For any two vertices u, v ∈ V of a connected undirected graph G = (V, E), the closed interval I[u, v] of u and v is the set of vertices that belong to some shortest (u, v)-path. For any S ⊆ V , let I[S] = u,v∈S I[u, v]. A subset S ⊆ V is (geodesically) convex if I[S] = S. Given a subset S ⊆ V ,… (More)

—Given an undirected graph G = (V, E) and a weight function w : V → R + , a vertex coloring of G is a partition of V into independent sets, or color classes. The weight of a vertex coloring of G is defined as the sum of the weights of its color classes, where the weight of a color class is the weight of a heaviest vertex belonging to it. In the W… (More)

- Júlio Araújo, Cláudia Linhares Sales
- Discrete Applied Mathematics
- 2012

The Grundy number of a graph G is the largest number of colors used by any execution of the greedy algorithm to color G. The problem of determining the Grundy number of G is polynomial if G is a P 4-free graph and N P-hard if G is a P 5-free graph. In this article, we define a new class of graphs, the fat-extended P 4-laden graphs, and we show a polynomial… (More)