[HTML][HTML] Counting cliques in 1-planar graphs
European Journal of Combinatorics, 2023•Elsevier
The problem of maximising the number of cliques among n-vertex graphs from various
graph classes has received considerable attention. We investigate this problem for the class
of 1-planar graphs where we determine precisely the maximum total number of cliques as
well as the maximum number of cliques of any fixed size. We also precisely characterise the
extremal graphs for these problems.
graph classes has received considerable attention. We investigate this problem for the class
of 1-planar graphs where we determine precisely the maximum total number of cliques as
well as the maximum number of cliques of any fixed size. We also precisely characterise the
extremal graphs for these problems.
The problem of maximising the number of cliques among n-vertex graphs from various graph classes has received considerable attention. We investigate this problem for the class of 1-planar graphs where we determine precisely the maximum total number of cliques as well as the maximum number of cliques of any fixed size. We also precisely characterise the extremal graphs for these problems.
Elsevier
以上显示的是最相近的搜索结果。 查看全部搜索结果