Search Results - "Morel, Gregory"
-
1
The chromatic number of {P5,K4}-free graphs
Published in Discrete mathematics (28-03-2013)“…Gyárfás conjectured that for any tree T every T-free graph G with maximum clique size ω(G) is fT(ω(G))-colorable, for some function fT that depends only on T…”
Get full text
Journal Article -
2
A characterization of chain probe graphs
Published in Annals of operations research (01-08-2011)“…A chain probe graph is a graph that admits an independent set S of vertices and a set F of pairs of elements of S such that G + F is a chain graph (i.e., a 2 K…”
Get full text
Journal Article -
3
Hull number: P5-free graphs and reduction rules
Published in Discrete Applied Mathematics (10-09-2016)“…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…”
Get full text
Journal Article -
4
Analysis of plane wave approximation for an electromagnetic wave illuminating an inhomogeneous ionosphere layer
Published in 2024 4th URSI Atlantic Radio Science Meeting (AT-RASC) (19-05-2024)“…The influence of the approximation of the electromagnetic wave illuminating an inhomogeneous ionospheric layer to a plane wave in the modeling of ionospheric…”
Get full text
Conference Proceeding