Titlebook: ;

神圣在玷污

要素

https://doi.org/10.1007/978-3-8349-4260-9 an .(.·.) algorithm to compute the cube representation of a general graph . in .?+?1 dimensions given a bandwidth ordering of the vertices of ., where . is the . of .. As a consequence, we get .(Δ) upper bounds on the cubicity of many well-known graph classes such as AT-free graphs, circular-arc gr