Zobrazeno 1 - 10
of 74
pro vyhledávání: '"Baudon Olivier"'
Publikováno v:
In Applied Mathematics and Computation 15 August 2024 475
Autor:
Baudon, Olivier, Pilsniak, Monika, Przybylo, Jakub, Senhaji, Mohammed, Sopena, Eric, Wozniak, Mariusz
With any (not necessarily proper) edge $k$-colouring $\gamma:E(G)\longrightarrow\{1,\dots,k\}$ of a graph $G$,one can associate a vertex colouring $\sigma\_{\gamma}$ given by $\sigma\_{\gamma}(v)=\sum\_{e\ni v}\gamma(e)$.A neighbour-sum-distinguishin
Externí odkaz:
http://arxiv.org/abs/1701.04648
Autor:
Baudon Olivier, Hocquard Hervé, Marczyk Antoni, Pilśniak Monika, Przybyło Jakub, Woźniak Mariusz
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 40, Iss 4, Pp 1175-1186 (2020)
A total k-coloring of a graph G is a coloring of vertices and edges of G using colors of the set {1, . . . , k}. These colors can be used to distinguish adjacent vertices of G. There are many possibilities of such a distinction. In this paper, we foc
Externí odkaz:
https://doaj.org/article/78d65607858d4c3ea2b34a04a1b5f587
Publikováno v:
In Discrete Applied Mathematics 1 November 2019 270:13-24
Publikováno v:
In Discrete Applied Mathematics 31 December 2018 251:83-92
Autor:
Baudon, Olivier, Przybyło, Jakub, Senhaji, Mohammed, Sidorowicz, Elżbieta, Sopena, Éric, Woźniak, Mariusz
Publikováno v:
In Discrete Mathematics July 2017 340(7):1564-1572
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 37, Iss 1, Pp 89-115 (2017)
A connected graph G is said to be arbitrarily partitionable (AP for short) if for every partition (n1, . . . , np) of |V (G)| there exists a partition (V1, . . . , Vp) of V (G) such that each Vi induces a connected subgraph of G on ni vertices. Some
Externí odkaz:
https://doaj.org/article/d159d66a65894a2f9dc91afdd2974437
Publikováno v:
In Journal of Discrete Algorithms January 2015 30:113-127
Autor:
Alayrangues, Sylvie, Baudon, Olivier, Beauvoir, Sylvain, Beffara, Emmanuel, Daniel, Sébastien, Declercq, Christophe, Héam, Anne, Marquet, Philippe, Masseron, Jean-Christophe, Meyer, Antoine, More, Malika, Nény, Florence, Prouteau, Cécile, Schwer, Sylviane, Vincent, Jean-Marc, Volte, Emmanuel, Grimaud, Aslı
Publikováno v:
Commission inter-IREM informatique. 2023
Cette brochure recense l’ensemble des exercices des épreuves du brevet ayant trait au thème « Algorithmique et programmation » du programme de mathématiques de cycle 4, de 2017 à 2022. Pour chaque exercice, sont identifiés les thèmes mathé
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::da49ed0de8823b7060b0e3ac35bc30dc
https://hal.science/hal-03996891/document
https://hal.science/hal-03996891/document
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 35, Iss 1, Pp 141-156 (2015)
The well-known 1-2-3 Conjecture addressed by Karoński, Luczak and Thomason asks whether the edges of every undirected graph G with no isolated edge can be assigned weights from {1, 2, 3} so that the sum of incident weights at each vertex yields a pr
Externí odkaz:
https://doaj.org/article/b062c7be63b2442099858bd7357b2bc4