Geodesic
The Widths of Strict Outerconfluent Graphs
Discrete mathematics & theoretical computer science, Tome 26 (2024) no. 3 Cet article a éte moissonné depuis la source Episciences

Voir la notice de l'article

Strict outerconfluent drawing is a style of graph drawing in which vertices are drawn on the boundary of a disk, adjacencies are indicated by the existence of smooth curves through a system of tracks within the disk, and no two adjacent vertices are connected by more than one of these smooth tracks. We investigate graph width parameters on the graphs that have drawings in this style. We prove that the clique-width of these graphs is unbounded, but their twin-width is bounded. 
@article{DMTCS_2024_26_3_a16,
     author = {Eppstein, David},
     title = {The {Widths} of {Strict} {Outerconfluent} {Graphs}},
     journal = {Discrete mathematics & theoretical computer science},
     year = {2024},
     volume = {26},
     number = {3},
     doi = {10.46298/dmtcs.12862},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.12862/}
}
TY  - JOUR
AU  - Eppstein, David
TI  - The Widths of Strict Outerconfluent Graphs
JO  - Discrete mathematics & theoretical computer science
PY  - 2024
VL  - 26
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.12862/
DO  - 10.46298/dmtcs.12862
LA  - en
ID  - DMTCS_2024_26_3_a16
ER  - 
%0 Journal Article
%A Eppstein, David
%T The Widths of Strict Outerconfluent Graphs
%J Discrete mathematics & theoretical computer science
%D 2024
%V 26
%N 3
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.12862/
%R 10.46298/dmtcs.12862
%G en
%F DMTCS_2024_26_3_a16
Eppstein, David. The Widths of Strict Outerconfluent Graphs. Discrete mathematics & theoretical computer science, Tome 26 (2024) no. 3. doi: 10.46298/dmtcs.12862

Cité par Sources :