Showing 2024Show all
3 papers · 1 filter
cs.DS2024
Recognizing 2-Layer and Outer -Planar Graphs
Yasuaki Kobayashi, Yuto Okada, Alexander Wolff
The crossing number of a graph is the least number of crossings over all drawings of the graph in the plane. Computing the crossing number of a given graph is NP-hard, but fixed-pa…
math.CO2024
Basis sequence reconfiguration in the union of matroids
Tesshu Hanaka, Yuni Iwamasa, Yasuaki Kobayashi +2
Given a graph and two spanning trees and in , Spanning Tree Reconfiguration asks whether there is a step-by-step transformation from to such that all inter…
cs.DM2024
Bounding the Treewidth of Outer -Planar Graphs via Triangulations
Oksana Firman, Grzegorz Gutowski, Myroslav Kryven +2
The treewidth is a structural parameter that measures the tree-likeness of a graph. Many algorithmic and combinatorial results are expressed in terms of the treewidth. In this pape…