Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 2
Objavljeni znanstveni prispevek na konferenci
Oznake: 1-planar;crossing type;treewidth;pathwidth;
A drawing of a graph is 1-planar if each edge participates in at most one crossing and adjacent edges do not cross. Up to symmetry, each crossing in a 1-planar drawing belongs to one out of six possible crossing types, where a type characterizes the subgraph induced by the four vertices of the cross ...
Leto: 2025 Vir: Fakulteta za matematiko in fiziko (UL FMF)
Objavljeni znanstveni prispevek na konferenci
Oznake: vertex-connectivity;graphs on surfaces;genus of a graph;
We provide a new linear-time algorithm for determining the vertex-connectivity of graphs with bounded genus. This generalizes and streamlines a linear-time algorithm for graphs with bounded crossing number which was recently obtained by Biedl, Bose and Murali [ESA 2024]. Compared to applying the eve ...
Leto: 2026 Vir: Fakulteta za matematiko in fiziko (UL FMF)
Št. zadetkov: 2
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: