Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Jean Florent Raymond"'
Autor:
Virgina Ardévol Martínez, Marco Caoduro, Laurent Feuilloley, Jonathan Narboni, Pegah Pournajafi, Jean-Florent Raymond
Publikováno v:
Lecture Notes in Computer Science, Stabilization, Safety, and Security of Distributed Systems, 24th International Symposium, SSS 2022
Stabilization, Safety, and Security of Distributed Systems, 24th International Symposium, SSS 2022, Clermont-Ferrand, France
Stabilization, Safety, and Security of Distributed Systems, 24th International Symposium, SSS 2022, Clermont-Ferrand, France, Nov 2022, Clermont-Ferrand, France. pp.239-253, ⟨10.1007/978-3-031-21017-4_16⟩
Lecture Notes in Computer Science ISBN: 9783031210167
Stabilization, Safety, and Security of Distributed Systems, 24th International Symposium, SSS 2022, Clermont-Ferrand, France
Stabilization, Safety, and Security of Distributed Systems, 24th International Symposium, SSS 2022, Clermont-Ferrand, France, Nov 2022, Clermont-Ferrand, France. pp.239-253, ⟨10.1007/978-3-031-21017-4_16⟩
Lecture Notes in Computer Science ISBN: 9783031210167
The full article is available on arxiv.; International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::999a7bcfe472cabdb6db8dc4dc77f310
https://uca.hal.science/hal-03874784
https://uca.hal.science/hal-03874784
Autor:
Jean-Florent Raymond
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 20 no. 1, Iss Graph Theory (2018)
The Erd\H{o}s-P\'osa property relates parameters of covering and packing of combinatorial structures and has been mostly studied in the setting of undirected graphs. In this note, we use results of Chudnovsky, Fradkin, Kim, and Seymour to show that,
Externí odkaz:
https://doaj.org/article/b3c0554ec1b34c45b43839b60b2d1efe
Publikováno v:
Journal of Combinatorial Theory, Series B
Journal of Combinatorial Theory, Series B, Elsevier, 2021, 148, pp.1-22. ⟨10.1016/j.jctb.2020.12.005⟩
Journal of Combinatorial Theory, Series B, 2021, 148, pp.1-22. ⟨10.1016/j.jctb.2020.12.005⟩
Journal of Combinatorial Theory, Series B, Elsevier, 2021, 148, pp.1-22. ⟨10.1016/j.jctb.2020.12.005⟩
Journal of Combinatorial Theory, Series B, 2021, 148, pp.1-22. ⟨10.1016/j.jctb.2020.12.005⟩
In 1990, Thomas proved that every graph admits a tree decomposition of minimum width that additionally satisfies a certain vertex-connectivity condition called leanness [A Menger-like property of tree-width: The finite case. Journal of Combinatorial
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0893f2fbaf828770c424bfa41cf3c88d
https://hal.archives-ouvertes.fr/hal-03094586
https://hal.archives-ouvertes.fr/hal-03094586
Publikováno v:
European Journal of Combinatorics
European Journal of Combinatorics, Elsevier, 2017, 65, pp.154-167. ⟨10.1016/j.ejc.2017.05.009⟩
European Journal of Combinatorics, Elsevier, 2017, 65, pp.154-167. 〈10.1016/j.ejc.2017.05.009〉
European Journal of Combinatorics, Elsevier, 2017, 65, pp.154-167. ⟨10.1016/j.ejc.2017.05.009⟩
European Journal of Combinatorics, Elsevier, 2017, 65, pp.154-167. 〈10.1016/j.ejc.2017.05.009〉
International audience; A graph H is an immersion of a graph G if H can be obtained by some subgraph G after lifting incident edges. We prove that there is a polynomial function f : N × N → N, such that if H is a connected planar sub-cubic graph o
Publikováno v:
Discrete Mathematics
Discrete Mathematics, Elsevier, In press
Discrete Mathematics, Elsevier, 2022, 345 (3), pp.112746. ⟨10.1016/j.disc.2021.112746⟩
Discrete Mathematics, 2022, 345 (3), pp.112746. ⟨10.1016/j.disc.2021.112746⟩
Discrete Mathematics, Elsevier, In press
Discrete Mathematics, Elsevier, 2022, 345 (3), pp.112746. ⟨10.1016/j.disc.2021.112746⟩
Discrete Mathematics, 2022, 345 (3), pp.112746. ⟨10.1016/j.disc.2021.112746⟩
International audience; In this paper, we prove that a graph $G$ with no $K_{s,s}$-subgraph and twin-width $d$ has $r$-admissibility and $r$-coloring numbers bounded from above by an exponential function of $r$ and that we can construct graphs achiev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::de1b01ca53c5ea0bba98ad6f83174de3
https://hal.uca.fr/hal-03450765/file/main.pdf
https://hal.uca.fr/hal-03450765/file/main.pdf
Autor:
O-joung Kwon, Jean-Florent Raymond
Publikováno v:
SIAM Journal on Discrete Mathematics
SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2021, 35 (2), pp.597-636. ⟨10.1137/18M1226166⟩
SIAM Journal on Discrete Mathematics, 2021, 35 (2), pp.597-636. ⟨10.1137/18M1226166⟩
SIAM Journal of Discrete Mathematics
SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2021, 35 (2), pp.597-636. ⟨10.1137/18M1226166⟩
SIAM Journal on Discrete Mathematics, 2021, 35 (2), pp.597-636. ⟨10.1137/18M1226166⟩
SIAM Journal of Discrete Mathematics
A class $\mathcal{F}$ of graphs has the induced Erd\H{o}s-P\'osa property if there exists a function $f$ such that for every graph $G$ and every positive integer $k$, $G$ contains either $k$ pairwise vertex-disjoint induced subgraphs that belong to $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f5088dd000ccecb8b4be830c8511bf80
https://hal.uca.fr/hal-03449910
https://hal.uca.fr/hal-03449910
Publikováno v:
Algorithmica
Algorithmica, 2020, 82 (9), pp.2432-2473. ⟨10.1007/s00453-020-00692-9⟩
26th Annual European Symposium on Algorithms (ESA 2018)
26th Annual European Symposium on Algorithms (ESA 2018), Aug 2018, Helsinki, Finland. pp.30:1--30:14, ⟨10.4230/LIPIcs.ESA.2018.30⟩
Algorithmica, Springer Verlag, 2020, 82 (9), pp.2432-2473. ⟨10.1007/s00453-020-00692-9⟩
Algorithmica, 2020, 82 (9), pp.2432-2473. ⟨10.1007/s00453-020-00692-9⟩
26th Annual European Symposium on Algorithms (ESA 2018)
26th Annual European Symposium on Algorithms (ESA 2018), Aug 2018, Helsinki, Finland. pp.30:1--30:14, ⟨10.4230/LIPIcs.ESA.2018.30⟩
Algorithmica, Springer Verlag, 2020, 82 (9), pp.2432-2473. ⟨10.1007/s00453-020-00692-9⟩
For a graph $H$, a graph $G$ is an $H$-graph if it is an intersection graph of connected subgraphs of some subdivision of $H$. $H$-graphs naturally generalize several important graph classes like interval or circular-arc graph. This class was introdu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b56597e0049b899e10fd9540e11ab95b
https://hal.uca.fr/hal-03449925
https://hal.uca.fr/hal-03449925
Publikováno v:
Journal of Combinatorial Theory, Series B
Journal of Combinatorial Theory, Series B, Elsevier, 2018, 〈10.1016/j.jctb.2018.05.005〉
8th European Conference on Combinatorics, Graph Theory and Applications
EuroComb: European Conference on Combinatorics, Graph Theory and Applications
EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Aug 2015, Bergen, Norway. pp.197-201, ⟨10.1016/j.endm.2015.06.029⟩
Journal of Combinatorial Theory, Series B, Elsevier, 2019, 134, pp.110-142. ⟨10.1016/j.jctb.2018.05.005⟩
Journal of Combinatorial Theory, Series B, 2019, 134, pp.110-142. ⟨10.1016/j.jctb.2018.05.005⟩
Journal of Combinatorial Theory, Series B, Elsevier, 2018, 〈10.1016/j.jctb.2018.05.005〉
8th European Conference on Combinatorics, Graph Theory and Applications
EuroComb: European Conference on Combinatorics, Graph Theory and Applications
EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Aug 2015, Bergen, Norway. pp.197-201, ⟨10.1016/j.endm.2015.06.029⟩
Journal of Combinatorial Theory, Series B, Elsevier, 2019, 134, pp.110-142. ⟨10.1016/j.jctb.2018.05.005⟩
Journal of Combinatorial Theory, Series B, 2019, 134, pp.110-142. ⟨10.1016/j.jctb.2018.05.005⟩
A graph $H$ is an induced minor of a graph $G$ if it can be obtained from an induced subgraph of $G$ by contracting edges. Otherwise, $G$ is said to be $H$-induced minor-free. Robin Thomas showed that $K_4$-induced minor-free graphs are well-quasi-or
Publikováno v:
SIAM Journal on Discrete Mathematics
SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2018, 32 (3), pp.2302-2312. ⟨10.1137/17M1153169⟩
SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2018, 32 (3), pp.2302-2312. ⟨10.1137/17M1153169⟩
International audience; Let $W_t$ denote the wheel on t+1 vertices. We prove that for every integer $t \geq 3$ there is a constant $c=c(t)$ such that for every integer $k \geq 1$ and every graph $G$, either $G$ has $k$ vertex-disjoint subgraphs each
Publikováno v:
European Journal of Combinatorics. 65:106-121
For every $r \in \mathbb{N}$, let $\theta_r$ denote the graph with two vertices and $r$ parallel edges. The \emph{$\theta_r$-girth} of a graph $G$ is the minimum number of edges of a subgraph of $G$ that can be contracted to $\theta_r$. This notion g