Titlebook: ;

招致

Delta-Confluent DrawingsWe generalize the . graphs to a broader class of graphs called Δ. graphs. This class of graphs and distance-hereditary graphs, a well-known class of graphs, coincide. Some results about the visualization of Δ-confluent graphs are also given.

Vldl379

https://doi.org/10.1007/978-3-030-96462-7ycle . of .. Is it possible to draw?. as a non-intersecting closed curve inside ., following the circles that correspond in . to the vertices of . and the strips that connect them? We show that this test can be done in polynomial time and study this problem in the framework of clustered planarity for highly non-connected clustered graphs.

Graduated