Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Athmakoori Prashant"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 21, Iss 2, Pp 152-160 (2024)
The class of [Formula: see text]-free graphs has been well studied in the past. In the paper “On the chromatic number of [Formula: see text]-free graphs, Discrete Applied Mathematics, 253 (2019), 14–24”, it was shown that the class of [Formula:
Externí odkaz:
https://doaj.org/article/4d6b0747e39047d0a42a77fc299e0dee
Publikováno v:
Discrete Applied Mathematics. 336:99-108
Autor:
Francis Raj S, Athmakoori Prashant
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783031252105
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd097abd88d6e7817c617602cea1d2fd
https://doi.org/10.1007/978-3-031-25211-2_15
https://doi.org/10.1007/978-3-031-25211-2_15
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783030950170
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2f016e8247b5898c3edd2dc0ab3b6b6f
https://doi.org/10.1007/978-3-030-95018-7_2
https://doi.org/10.1007/978-3-030-95018-7_2
Autor:
M. Gokulnath, Athmakoori Prashant
Publikováno v:
Algorithms and Discrete Applied Mathematics ISBN: 9783030678982
CALDAM
CALDAM
In this paper, we study the chromatic number for graphs with forbidden induced subgraphs. We improve the existing \(\chi \)-binding functions for some subclasses of \(2K_2\)-free graphs, namely \(\{2K_2, H\}\)-free graphs where \(H\in \{HVN, K_5-e, K
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4afda835c26f0a1c5eeac42104a3cdda
https://doi.org/10.1007/978-3-030-67899-9_23
https://doi.org/10.1007/978-3-030-67899-9_23