Digital repository of Slovenian research organisations

Show document
A+ | A- | Help | SLO | ENG

Title:A dichotomy for 1-planarity with restricted crossing types parameterized by treewidth
Authors:ID Cabello, Sergio (Author)
ID Dobler, Alexander (Author)
ID Fijavž, Gašper (Author)
ID Hamm, Thekla (Author)
ID Wagner, Mirko H. (Author)
Files:.pdf PDF - Presentation file, download (843,13 KB)
MD5: 99F8A2DEAC75183A893C2DA5D3178B14
 
URL URL - Source URL, visit https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2025.16
 
Language:English
Typology:1.08 - Published Scientific Conference Contribution
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
Abstract: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 crossing edges. Each of the 63 possible nonempty subsets ${\mathcal S}$ of crossing types gives a recognition problem: does a given graph admit an ${\mathcal S}$-restricted drawing, that is, a 1-planar drawing where the crossing type of each crossing is in ${\mathcal S}$? We show that there is a set ${\mathcal S}_{\rm bad}$ with three crossing types and the following properties: (i) If ${\mathcal S}$ contains no crossing type from ${\mathcal S}_{\rm bad}$, then the recognition of graphs that admit an ${\mathcal S}$-restricted drawing is fixed-parameter tractable with respect to the treewidth of the input graph. (ii) If ${\mathcal S}$ contains any crossing type from ${\mathcal S}_{\rm bad}$, then it is NP-hard to decide whether a graph has an ${\mathcal S}$-restricted drawing, even when considering graphs of constant pathwidth. We also extend this characterization of crossing types to 1-planar straight-line drawings and show the same complexity behaviour parameterized by treewidth.
Keywords:1-planar, crossing type, treewidth, pathwidth
Publication status:Published
Publication version:Version of Record
Year of publishing:2025
Number of pages:15 str.
PID:20.500.12556/DiRROS-25062 New window
UDC:004.42:519.17
DOI:10.4230/LIPIcs.ISAAC.2025.16 New window
COBISS.SI-ID:263974915 New window
Note:
Publication date in DiRROS:08.01.2026
Views:495
Downloads:249
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a monograph

Title:36th International Symposium on Algorithms and Computation : ISAAC 2025, December 7-10, 2025, Tainan, Taiwan
Editors:Ho-Lin Chen, Wing-Kai Hon, Meng-Tsung Tsai
Place of publishing:Saarbrücken/Wadern
Publisher:Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing
Year of publishing:2025
ISBN:978-3-95977-408-6
COBISS.SI-ID:263944195 New window
Collection title:Leibniz international proceedings in informatics
Collection numbering:ǂvol. ǂ359
Collection ISSN:1868-8969

Document is financed by a project

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0297
Name:Teorija grafov

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0218
Name:Prepletanje geometrije, topologije in algebre v strukturni in topološki teoriji grafov

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0285
Name:Metrični problemi v grafih in hipergrafih

Funder:EC - European Commission
Project number:101071836
Name:KARST: Predicting flow and transport in complex Karst systems
Acronym:KARST

Funder:WWTF - Vienna Science and Technology Fund
Project number:10.47379/ICT19035

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Back