Zobrazeno 1 - 10
of 1 052
pro vyhledávání: '"perfect graphs"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science (DMTCS). 2022, Vol. 24 Issue 1, p1-18. 18p.
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
Autor:
Martin Charles Golumbic
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 21, Iss 2, Pp 209-217 (2024)
Mathematical explorations steer us through fields and forests of applications where science and computing meet discrete structures and combinatorics. Today’s excursion takes us on one of the speaker’s favorite journeys in the world of algorithmic
Externí odkaz:
https://doaj.org/article/9f02a3ce00fc4474ab6be0367e971d43
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 21, Iss 1, Pp 77-83 (2024)
AbstractA graph G is an integral sum graph (sum graph) if its vertices can be labeled with distinct integers (positive integers) so that e = uv is an edge of G if and only if the sum of the labels on vertices u and v is also a label in G. A graph G i
Externí odkaz:
https://doaj.org/article/01b3946da54f46799e7bb5707e5fef54
Autor:
Benchetrit, Yohann y.benchet@gmail.com
Publikováno v:
Mathematical Programming. Jul2017, Vol. 164 Issue 1/2, p245-262. 18p.
Autor:
Tsujie, Shuhei1 tsujie@edu.hkg.ac.jp
Publikováno v:
Graphs & Combinatorics. Sep2018, Vol. 34 Issue 5, p1037-1048. 12p.
Autor:
Chudnovsky, Maria1 mchudnov@math.princeton.edu
Publikováno v:
Journal of Graph Theory. Mar2018, Vol. 87 Issue 3, p271-274. 4p.
Autor:
Purkayastha, Saugata1 sau.pur@rediffmail.com, Goswami, Jituparna1 2jituparnagoswami18@gmail.com, Debnath, Bhargab1 bhargabdnath14@rediffmail.com
Publikováno v:
Matematika. Jun2017, Vol. 33, p97-103. 7p.
Autor:
Bevern, René1,2 rvb@nsu.ru, Bredereck, Robert2 robert.bredereck@tu-berlin.de, Bulteau, Laurent3 l.bulteau@gmail.com, Chen, Jiehua2 jiehua.chen@tu-berlin.de, Froese, Vincent2 vincent.froese@tu-berlin.de, Niedermeier, Rolf2 rolf.niedermeier@tu-berlin.de, Woeginger, Gerhard J.4 gwoegi@win.tue.nl
Publikováno v:
Journal of Graph Theory. Jun2017, Vol. 85 Issue 2, p297-335. 39p.