On the complexity of vertex-splitting into an interval graph

DOI10.1007/978-3-032-27732-9_1MaRDI QIDQ7363365zbMATH OpenFDO

Authors Faisal N. Abu-Khzam, Dipayan Chakraborty, Lucas Isenmann, Nacim Oijid

Publication date 29 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-27732-9_1

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• Bicluster editing with overlaps: a vertex splitting approach
• Circular flows of nearly Eulerian graphs and vertex-splitting
• Cluster editing with vertex splitting
• Complexity classification of some edge modification problems
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• Interval \(k\)-graphs and orders
• Measuring indifference: unit interval vertex deletion
• On double and multiple interval graphs
• On rigid circuit graphs
• On the complexity of 2-club cluster editing with vertex splitting
• On the planar split thickness of graphs
• Planarizing graphs and their drawings by vertex splitting
• Structure theorems for some circular-arc graphs
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• The complexity of cluster vertex splitting and company
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• The node-deletion problem for hereditary properties is NP-complete
• The Planar Hamiltonian Circuit Problem is NP-Complete

This page was built for publication: On the complexity of vertex-splitting into an interval graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363365)