Search Results - "Sopena, E"
-
1
Homomorphisms and colourings of oriented graphs: An updated survey
Published in Discrete mathematics (06-07-2016)“…An oriented graph is a loopless digraph with no opposite arcs. An oriented k-colouring of an oriented graph G⃗ is a partition of its set of vertices into k…”
Get full text
Journal Article -
2
Increased survival time or better quality of life? Trade-off between benefits and adverse events in the systemic treatment of cancer
Published in Clinical & translational oncology (01-06-2020)“…Introduction Primary objective of the study was to assess the relative weighting between benefit in survival time (SV), benefit in quality of life (QoL) and…”
Get full text
Journal Article -
3
The incidence game chromatic number of (a,d)-decomposable graphs
Published in Journal of discrete algorithms (Amsterdam, Netherlands) (01-03-2015)“…The incidence coloring game has been introduced in Andres (2009) [2] as a variation of the ordinary coloring game. The incidence game chromatic number ιg(G) of…”
Get full text
Journal Article -
4
-
5
Acyclic colouring of 1-planar graphs
Published in Discrete Applied Mathematics (30-10-2001)“…A graph is 1-planar if it can be drawn on the plane in such a way that every edge crosses at most one other edge. We prove that the acyclic chromatic number of…”
Get full text
Journal Article -
6
On the maximum average degree and the oriented chromatic number of a graph
Published in Discrete mathematics (28-08-1999)“…The oriented chromatic number o( H) of an oriented graph H is defined as the minimum order of an oriented graph H′ such that H has a homomorphism to H′. The…”
Get full text
Journal Article -
7
Acyclic and oriented chromatic numbers of graphs
Published in Journal of graph theory (01-04-1997)“…The oriented chromatic number χo(G →) of an oriented graph G → = (V, A) is the minimum number of vertices in an oriented graph H → for which there exists a…”
Get full text
Journal Article -
8
Acyclic list 7-coloring of planar graphs
Published in Journal of graph theory (01-06-2002)“…The acyclic list chromatic number of every planar graph is proved to be at most 7. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 83–90, 2002…”
Get full text
Journal Article -
9
On nice graphs
Published in Discrete mathematics (06-05-2001)“…A digraph G is k-nice for some positive integer k if for every two (not necessarily distinct) vertices x and y in G and every pattern of length k, given as a…”
Get full text
Journal Article -
10
-
11
On universal graphs for planar oriented graphs of a given girth
Published in Discrete mathematics (28-06-1998)“…The oriented chromatic number o( H) of an oriented graph H is defined to be the minimum order of an oriented graph H′ such that H has a homomorphism to H′. If…”
Get full text
Journal Article -
12
Perfil asistencial del paciente con osteoporosis tributario de visita de telemedicina en la era post-COVID-19
Published in Revista de osteoporosis y metabolismo mineral (01-03-2021)Get full text
Journal Article -
13
Oriented graph coloring
Published in Discrete mathematics (28-02-2001)“…An oriented k-coloring of an oriented graph G (that is a digraph with no cycle of length 2) is a partition of its vertex set into k subsets such that (i) no…”
Get full text
Journal Article -
14
Hexachlorobenzene Treatment on Hepatic Mitochondrial Function Parameters and Intracellular Coproporphyrinogen Oxidase Location
Published in International journal of toxicology (01-11-2008)“…These studies try to elucidate why isocoproporphyrin appears in hexachlorobenzene-poisoned rats’ feces. Chronic exposure of hexachlorobenzene to rats produces…”
Get full text
Journal Article -
15
Compound Node–Kayles on paths
Published in Theoretical computer science (17-05-2009)“…In his celebrated book [J.H. Conway, On Numbers and Games, Academic Press, New-York, 1976, Second edition (2001), A.K. Peters, Wellesley, MA], J.H. Conway…”
Get full text
Journal Article -
16
Different local controls for graph relabeling systems
Published in Mathematical Systems Theory (01-01-1995)Get full text
Journal Article -
17
The chromatic number of oriented graphs
Published in Journal of graph theory (01-07-1997)“…We introduce in this paper the notion of the chromatic number of an oriented graph G (that is of an antisymmetric directed graph) defined as the minimum order…”
Get full text
Journal Article -
18
Perfil asistencial del paciente con osteoporosis tributario de visita de telemedicina en la era post-COVID-19
Published in Revista de osteoporosis y metabolismo mineral (01-03-2021)“…Resumen Resumen Definir el perfil del paciente con osteoporosis candidato y no candidato a la asistencia en la teleconsulta de osteoporosis, en la era…”
Get full text
Journal Article -
19
There exist oriented planar graphs with oriented chromatic number at least sixteen
Published in Information processing letters (31-03-2002)“…We prove that there exist oriented planar graphs with oriented chromatic number at least 16. Using a result of Raspaud and Sopena [Inform. Process. Lett. 51…”
Get full text
Journal Article -
20
Incidence coloring of k-degenerated graphs
Published in Discrete mathematics (06-06-2004)“…We prove that the incidence coloring number of every k-degenerated graph G is at most Δ( G)+2 k−1. For K 4-minor free graphs ( k=2), we decrease this bound to…”
Get full text
Journal Article