Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Puges, Diane"'
Autor:
Brosch, Daniel, Puges, Diane
The inducibility of a graph represents its maximum density as an induced subgraph over all possible sequences of graphs of size growing to infinity. This invariant of graphs has been extensively studied since its introduction in $1975$ by Pippenger a
Externí odkaz:
http://arxiv.org/abs/2404.12838
Given a linear ordering of the vertices of a graph, the cutwidth of a vertex $v$ with respect to this ordering is the number of edges from any vertex before $v$ (including $v$) to any vertex after $v$ in this ordering. The cutwidth of an ordering is
Externí odkaz:
http://arxiv.org/abs/2301.03900
Publikováno v:
In Computers and Operations Research January 2024 161
