Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Chacko, Daphna"'
Autor:
Chacko, Daphna, Francis, Mathew C.
A graph $G$ is said to be the intersection of graphs $G_1,G_2,\ldots,G_k$ if $V(G)=V(G_1)=V(G_2)=\cdots=V(G_k)$ and $E(G)=E(G_1)\cap E(G_2)\cap\cdots\cap E(G_k)$. For a graph $G$, $\mathrm{dim}_{COG}(G)$ (resp. $\mathrm{dim}_{TH}(G)$) denotes the min
Externí odkaz:
http://arxiv.org/abs/2001.00798
Publikováno v:
In Discrete Applied Mathematics 15 October 2022 319:53-60
A plane near-triangulation G can be decomposed into a collection of induced subgraphs, described here as the W-components of G, such that G is perfect (respectively, chordal) if and only if each of its W-components is perfect (respectively, chordal).
Externí odkaz:
http://arxiv.org/abs/1701.03447
Publikováno v:
In Procedia Computer Science 2020 171:755-760