Embedding graphs into two-dimensional simplicial complexes - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Computing in Geometry and Topology Année : 2022

Embedding graphs into two-dimensional simplicial complexes

Résumé

We consider the problem of deciding whether an input graph G admits a topological embedding into an input two-dimensional simplicial complex C. This problem includes, among others, the embeddability problem of a graph on a surface and the topological crossing number of a graph, but is more general. The problem is NP-complete in general (if C is part of the input), and we give an algorithm that runs in polynomial time for any fixed C. Our strategy is to reduce the problem into an embedding extension problem on a surface, which has the following form: Given a subgraph H' of a graph G', and an embedding of H' on a surface S, can that embedding be extended to an embedding of G' on S? Such problems can be solved, in turn, using a key component in Mohar's algorithm to decide the embeddability of a graph on a fixed surface (STOC 1996, SIAM J. Discr. Math. 1999).

Domaines

Informatique
Fichier principal
Vignette du fichier
embedding.pdf (716.53 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Licence : CC BY - Paternité

Dates et versions

hal-04269443 , version 1 (03-11-2023)

Licence

Paternité

Identifiants

Citer

Éric Colin de Verdière, Thomas Magnard, Bojan Mohar. Embedding graphs into two-dimensional simplicial complexes. Computing in Geometry and Topology, 2022, 1 (1), pp.1-23. ⟨10.57717/cgt.v1i1.11⟩. ⟨hal-04269443⟩
25 Consultations
11 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More