Titlebook: ;

ESPY

https://doi.org/10.1007/978-3-658-36300-0s and show that these are equivalent to homothetic triangle contact representations of maximally planar graphs. We believe that this new interpretation of the problem might allow for efficient algorithms to find homothetic triangle contact representations, that do not use Schramm’s monster packing theorem.

MORT

分發(fā)

Tree-Like Structures in Graphs: A Metric Point of View, graphs. We discuss these parameters and recently established relationships between them for unweighted and undirected graphs; it turns out that all these parameters are at most constant or logarithmic factors apart from each other. We give inequalities describing their relationships and discuss consequences for some optimization problems.

入會(huì)

平淡而無味

Linear Separation of Total Dominating Sets in Graphs,al domishold graphs, and obtain partial results towards a characterization of graphs in which the above property holds in a hereditary sense. Our characterization in the case of split graphs is obtained by studying a new family of hypergraphs, defined similarly as the Sperner hypergraphs, which may be of independent interest.

弓箭

梯田

https://doi.org/10.1007/978-3-662-57712-7if the graph contains a single source and a single sink but only for the plane and standing cylinder..Here we show that there is a linear-time algorithm to test whether a strongly connected graph is upward planar on the rolling cylinder. For our algorithm, we introduce dual and directed SPQR-trees as extensions of SPQR-trees.

粗糙濫制

FECT