Recognizing unit multiple interval graphs is hard

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Recognizing graphs with fixed interval number is NP-complete
On the parameterized complexity of multiple-interval graph problems
Open-interval graphs versus closed-interval graphs
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
A short proof that `proper = unit'
A special planar satisfiability problem and a consequence of its NP- completeness
The complexity of induced minors and related problems
On the computational complexity of 2-interval pattern matching problems
The maximum clique problem in multiple interval graphs
Recognizing \(d\)-interval graphs and \(d\)-track interval graphs
Optimization problems in multiple-interval graphs
The LBFS Structure and Recognition of Interval Graphs
On double and multiple interval graphs
Representation of a finite graph by a set of intervals on the real line
On Restrictions of Balanced 2-Interval Graphs
The Complexity of the Partial Order Dimension Problem
Extremal Values of the Interval Number of a Graph
Topics in Intersection Graph Theory
Unit Interval Graphs of Open and Closed Intervals
Determining DNA sequence similarity using maximum independent set algorithms for interval graphs
Scheduling Split Intervals
Parameterized Algorithms
A unified approach to approximating resource allocation and scheduling
34th international symposium on algorithms and computation (ISAAC 2023), Kyoto, Japan, December 3--6, 2023

This page was built for publication: Recognizing unit multiple interval graphs is hard

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